./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:24:11,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:24:11,477 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 19:24:11,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:24:11,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:24:11,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:24:11,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:24:11,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:24:11,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:24:11,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:24:11,510 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:24:11,510 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:24:11,511 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:24:11,512 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:24:11,512 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:24:11,513 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:24:11,513 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:24:11,514 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:24:11,514 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:24:11,515 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:24:11,515 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:24:11,516 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:24:11,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 19:24:11,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 19:24:11,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:24:11,518 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:24:11,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:24:11,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:24:11,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:24:11,520 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 19:24:11,520 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 19:24:11,520 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 19:24:11,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:24:11,521 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 19:24:11,521 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 19:24:11,521 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:24:11,522 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:24:11,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:24:11,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:24:11,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:24:11,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:24:11,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:24:11,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:24:11,523 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:24:11,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:24:11,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:24:11,524 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:24:11,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:24:11,524 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd [2023-12-02 19:24:11,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:24:11,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:24:11,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:24:11,743 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:24:11,743 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:24:11,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2023-12-02 19:24:14,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:24:14,833 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:24:14,833 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2023-12-02 19:24:14,852 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/data/48b3673fc/34ff135a54684a5ea0163d434dfc2b1d/FLAG51f0e12a1 [2023-12-02 19:24:14,867 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/data/48b3673fc/34ff135a54684a5ea0163d434dfc2b1d [2023-12-02 19:24:14,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:24:14,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:24:14,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:24:14,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:24:14,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:24:14,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:24:14" (1/1) ... [2023-12-02 19:24:14,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d5913a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:14, skipping insertion in model container [2023-12-02 19:24:14,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:24:14" (1/1) ... [2023-12-02 19:24:14,962 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:24:15,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:24:15,634 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-12-02 19:24:15,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@78efa33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:15, skipping insertion in model container [2023-12-02 19:24:15,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:24:15,635 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 19:24:15,637 INFO L158 Benchmark]: Toolchain (without parser) took 765.13ms. Allocated memory is still 159.4MB. Free memory was 113.3MB in the beginning and 79.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-12-02 19:24:15,637 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:24:15,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 762.70ms. Allocated memory is still 159.4MB. Free memory was 113.3MB in the beginning and 79.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-12-02 19:24:15,640 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 762.70ms. Allocated memory is still 159.4MB. Free memory was 113.3MB in the beginning and 79.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:24:17,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:24:17,401 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 19:24:17,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:24:17,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:24:17,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:24:17,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:24:17,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:24:17,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:24:17,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:24:17,440 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:24:17,440 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:24:17,441 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:24:17,441 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:24:17,442 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:24:17,442 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:24:17,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 19:24:17,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 19:24:17,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:24:17,445 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:24:17,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:24:17,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:24:17,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:24:17,447 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 19:24:17,447 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 19:24:17,448 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 19:24:17,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:24:17,449 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 19:24:17,449 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 19:24:17,449 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 19:24:17,450 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 19:24:17,450 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:24:17,451 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:24:17,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:24:17,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 19:24:17,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:24:17,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:24:17,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:24:17,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:24:17,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:24:17,453 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 19:24:17,453 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 19:24:17,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:24:17,453 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:24:17,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:24:17,454 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd [2023-12-02 19:24:17,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:24:17,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:24:17,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:24:17,751 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:24:17,751 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:24:17,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2023-12-02 19:24:20,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:24:20,923 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:24:20,924 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2023-12-02 19:24:20,945 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/data/55d7c40a8/c1655254948f4129bbc5ad7a692389fe/FLAG8aa366b16 [2023-12-02 19:24:20,957 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/data/55d7c40a8/c1655254948f4129bbc5ad7a692389fe [2023-12-02 19:24:20,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:24:20,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:24:20,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:24:20,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:24:20,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:24:20,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:24:20" (1/1) ... [2023-12-02 19:24:20,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e591242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:20, skipping insertion in model container [2023-12-02 19:24:20,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:24:20" (1/1) ... [2023-12-02 19:24:21,032 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:24:21,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:24:21,716 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 19:24:21,737 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:24:21,871 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:24:21,875 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:24:21,965 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:24:22,005 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 19:24:22,013 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:24:22,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:22 WrapperNode [2023-12-02 19:24:22,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:24:22,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:24:22,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:24:22,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:24:22,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:22" (1/1) ... [2023-12-02 19:24:22,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:22" (1/1) ... [2023-12-02 19:24:22,158 INFO L138 Inliner]: procedures = 180, calls = 783, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3040 [2023-12-02 19:24:22,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:24:22,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:24:22,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:24:22,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:24:22,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:22" (1/1) ... [2023-12-02 19:24:22,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:22" (1/1) ... [2023-12-02 19:24:22,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:22" (1/1) ... [2023-12-02 19:24:22,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:22" (1/1) ... [2023-12-02 19:24:22,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:22" (1/1) ... [2023-12-02 19:24:22,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:22" (1/1) ... [2023-12-02 19:24:22,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:22" (1/1) ... [2023-12-02 19:24:22,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:22" (1/1) ... [2023-12-02 19:24:22,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:24:22,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:24:22,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:24:22,325 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:24:22,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:22" (1/1) ... [2023-12-02 19:24:22,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:24:22,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:24:22,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:24:22,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:24:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 19:24:22,398 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 19:24:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 19:24:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 19:24:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 19:24:22,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 19:24:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 19:24:22,399 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 19:24:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 19:24:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:24:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 19:24:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 19:24:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-12-02 19:24:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 19:24:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:24:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 19:24:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 19:24:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:24:22,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:24:22,600 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:24:22,603 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:24:22,624 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 19:24:28,250 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:24:28,402 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:24:28,402 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-12-02 19:24:28,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:24:28 BoogieIcfgContainer [2023-12-02 19:24:28,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:24:28,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:24:28,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:24:28,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:24:28,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:24:20" (1/3) ... [2023-12-02 19:24:28,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9cebf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:24:28, skipping insertion in model container [2023-12-02 19:24:28,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:24:22" (2/3) ... [2023-12-02 19:24:28,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9cebf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:24:28, skipping insertion in model container [2023-12-02 19:24:28,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:24:28" (3/3) ... [2023-12-02 19:24:28,413 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test9-2.i [2023-12-02 19:24:28,432 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:24:28,432 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 535 error locations. [2023-12-02 19:24:28,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:24:28,520 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@458c2d89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:24:28,520 INFO L358 AbstractCegarLoop]: Starting to check reachability of 535 error locations. [2023-12-02 19:24:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 1974 states, 933 states have (on average 2.2411575562700965) internal successors, (2091), 1967 states have internal predecessors, (2091), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2023-12-02 19:24:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 19:24:28,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:24:28,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 19:24:28,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:24:28,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:24:28,543 INFO L85 PathProgramCache]: Analyzing trace with hash 177931, now seen corresponding path program 1 times [2023-12-02 19:24:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:24:28,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735692259] [2023-12-02 19:24:28,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:24:28,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:28,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:24:28,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:24:28,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 19:24:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:24:28,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:24:28,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:24:28,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:24:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:24:28,799 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:24:28,799 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:24:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735692259] [2023-12-02 19:24:28,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735692259] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:24:28,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:24:28,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 19:24:28,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295518646] [2023-12-02 19:24:28,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:24:28,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:24:28,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:24:28,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:24:28,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:28,842 INFO L87 Difference]: Start difference. First operand has 1974 states, 933 states have (on average 2.2411575562700965) internal successors, (2091), 1967 states have internal predecessors, (2091), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:24:31,631 INFO L93 Difference]: Finished difference Result 2126 states and 3192 transitions. [2023-12-02 19:24:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:24:31,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-12-02 19:24:31,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:24:31,667 INFO L225 Difference]: With dead ends: 2126 [2023-12-02 19:24:31,667 INFO L226 Difference]: Without dead ends: 2125 [2023-12-02 19:24:31,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:31,672 INFO L413 NwaCegarLoop]: 2526 mSDtfsCounter, 1896 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:24:31,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 2654 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-02 19:24:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2023-12-02 19:24:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1960. [2023-12-02 19:24:32,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 936 states have (on average 2.1474358974358974) internal successors, (2010), 1953 states have internal predecessors, (2010), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2023-12-02 19:24:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 3018 transitions. [2023-12-02 19:24:32,106 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 3018 transitions. Word has length 2 [2023-12-02 19:24:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:24:32,106 INFO L495 AbstractCegarLoop]: Abstraction has 1960 states and 3018 transitions. [2023-12-02 19:24:32,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 3018 transitions. [2023-12-02 19:24:32,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 19:24:32,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:24:32,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 19:24:32,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:24:32,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:32,311 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:24:32,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:24:32,311 INFO L85 PathProgramCache]: Analyzing trace with hash 177932, now seen corresponding path program 1 times [2023-12-02 19:24:32,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:24:32,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477547044] [2023-12-02 19:24:32,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:24:32,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:32,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:24:32,314 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:24:32,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 19:24:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:24:32,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:24:32,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:24:32,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:24:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:24:32,447 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:24:32,447 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:24:32,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477547044] [2023-12-02 19:24:32,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477547044] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:24:32,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:24:32,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 19:24:32,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899059878] [2023-12-02 19:24:32,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:24:32,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:24:32,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:24:32,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:24:32,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:32,450 INFO L87 Difference]: Start difference. First operand 1960 states and 3018 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:24:36,452 INFO L93 Difference]: Finished difference Result 3331 states and 5422 transitions. [2023-12-02 19:24:36,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:24:36,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-12-02 19:24:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:24:36,477 INFO L225 Difference]: With dead ends: 3331 [2023-12-02 19:24:36,477 INFO L226 Difference]: Without dead ends: 3331 [2023-12-02 19:24:36,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:36,479 INFO L413 NwaCegarLoop]: 2840 mSDtfsCounter, 1403 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1903 SdHoareTripleChecker+Valid, 4824 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:24:36,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1903 Valid, 4824 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-02 19:24:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2023-12-02 19:24:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3062. [2023-12-02 19:24:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 1539 states have (on average 2.0909681611436) internal successors, (3218), 3055 states have internal predecessors, (3218), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 19:24:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 5226 transitions. [2023-12-02 19:24:36,877 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 5226 transitions. Word has length 2 [2023-12-02 19:24:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:24:36,877 INFO L495 AbstractCegarLoop]: Abstraction has 3062 states and 5226 transitions. [2023-12-02 19:24:36,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 5226 transitions. [2023-12-02 19:24:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 19:24:36,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:24:36,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 19:24:36,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 19:24:37,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:37,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:24:37,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:24:37,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1114172565, now seen corresponding path program 1 times [2023-12-02 19:24:37,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:24:37,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015537596] [2023-12-02 19:24:37,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:24:37,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:37,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:24:37,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:24:37,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 19:24:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:24:37,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 19:24:37,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:24:37,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:24:37,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:24:37,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:24:37,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 19:24:37,306 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:24:37,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:24:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:24:37,326 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:24:37,326 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:24:37,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015537596] [2023-12-02 19:24:37,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015537596] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:24:37,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:24:37,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:24:37,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711986388] [2023-12-02 19:24:37,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:24:37,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:24:37,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:24:37,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:24:37,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:24:37,329 INFO L87 Difference]: Start difference. First operand 3062 states and 5226 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:24:42,278 INFO L93 Difference]: Finished difference Result 3216 states and 5388 transitions. [2023-12-02 19:24:42,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:24:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-12-02 19:24:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:24:42,296 INFO L225 Difference]: With dead ends: 3216 [2023-12-02 19:24:42,296 INFO L226 Difference]: Without dead ends: 3216 [2023-12-02 19:24:42,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:24:42,297 INFO L413 NwaCegarLoop]: 2263 mSDtfsCounter, 4025 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4528 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:24:42,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4528 Valid, 2324 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-02 19:24:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2023-12-02 19:24:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 1949. [2023-12-02 19:24:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 936 states have (on average 2.1346153846153846) internal successors, (1998), 1942 states have internal predecessors, (1998), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2023-12-02 19:24:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 3006 transitions. [2023-12-02 19:24:42,561 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 3006 transitions. Word has length 6 [2023-12-02 19:24:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:24:42,561 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 3006 transitions. [2023-12-02 19:24:42,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 3006 transitions. [2023-12-02 19:24:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 19:24:42,562 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:24:42,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:24:42,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-02 19:24:42,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:42,765 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:24:42,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:24:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash 179611130, now seen corresponding path program 1 times [2023-12-02 19:24:42,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:24:42,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128777885] [2023-12-02 19:24:42,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:24:42,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:42,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:24:42,770 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:24:42,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 19:24:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:24:42,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:24:42,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:24:42,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:24:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:24:42,914 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:24:42,914 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:24:42,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128777885] [2023-12-02 19:24:42,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128777885] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:24:42,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:24:42,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:24:42,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175600516] [2023-12-02 19:24:42,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:24:42,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:24:42,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:24:42,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:24:42,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:42,916 INFO L87 Difference]: Start difference. First operand 1949 states and 3006 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2023-12-02 19:24:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:24:45,522 INFO L93 Difference]: Finished difference Result 3092 states and 5171 transitions. [2023-12-02 19:24:45,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:24:45,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 [2023-12-02 19:24:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:24:45,540 INFO L225 Difference]: With dead ends: 3092 [2023-12-02 19:24:45,541 INFO L226 Difference]: Without dead ends: 3092 [2023-12-02 19:24:45,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:45,542 INFO L413 NwaCegarLoop]: 4628 mSDtfsCounter, 1722 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2225 SdHoareTripleChecker+Valid, 6849 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:24:45,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2225 Valid, 6849 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-02 19:24:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2023-12-02 19:24:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 1902. [2023-12-02 19:24:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 936 states have (on average 2.0844017094017095) internal successors, (1951), 1895 states have internal predecessors, (1951), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2023-12-02 19:24:45,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2959 transitions. [2023-12-02 19:24:45,790 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2959 transitions. Word has length 7 [2023-12-02 19:24:45,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:24:45,790 INFO L495 AbstractCegarLoop]: Abstraction has 1902 states and 2959 transitions. [2023-12-02 19:24:45,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2023-12-02 19:24:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2959 transitions. [2023-12-02 19:24:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 19:24:45,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:24:45,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:24:45,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-02 19:24:45,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:45,992 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:24:45,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:24:45,993 INFO L85 PathProgramCache]: Analyzing trace with hash 179611131, now seen corresponding path program 1 times [2023-12-02 19:24:45,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:24:45,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386881062] [2023-12-02 19:24:45,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:24:45,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 [2023-12-02 19:24:45,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:24:45,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:24:45,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 19:24:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:24:46,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:24:46,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:24:46,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:24:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:24:46,113 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:24:46,113 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:24:46,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386881062] [2023-12-02 19:24:46,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386881062] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:24:46,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:24:46,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:24:46,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545078930] [2023-12-02 19:24:46,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:24:46,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:24:46,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:24:46,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:24:46,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:46,114 INFO L87 Difference]: Start difference. First operand 1902 states and 2959 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2023-12-02 19:24:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:24:49,585 INFO L93 Difference]: Finished difference Result 3150 states and 5232 transitions. [2023-12-02 19:24:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:24:49,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 [2023-12-02 19:24:49,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:24:49,607 INFO L225 Difference]: With dead ends: 3150 [2023-12-02 19:24:49,607 INFO L226 Difference]: Without dead ends: 3150 [2023-12-02 19:24:49,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:49,608 INFO L413 NwaCegarLoop]: 4775 mSDtfsCounter, 1440 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 7121 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:24:49,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1940 Valid, 7121 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-02 19:24:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2023-12-02 19:24:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 1915. [2023-12-02 19:24:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 959 states have (on average 2.0834202294056308) internal successors, (1998), 1908 states have internal predecessors, (1998), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2023-12-02 19:24:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 3006 transitions. [2023-12-02 19:24:49,956 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 3006 transitions. Word has length 7 [2023-12-02 19:24:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:24:49,956 INFO L495 AbstractCegarLoop]: Abstraction has 1915 states and 3006 transitions. [2023-12-02 19:24:49,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2023-12-02 19:24:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 3006 transitions. [2023-12-02 19:24:49,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 19:24:49,957 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:24:49,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:24:49,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 19:24:50,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:50,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr428REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:24:50,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:24:50,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1468981190, now seen corresponding path program 1 times [2023-12-02 19:24:50,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:24:50,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679308047] [2023-12-02 19:24:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:24:50,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:50,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:24:50,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:24:50,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 19:24:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:24:50,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:24:50,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:24:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:24:50,344 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:24:50,344 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:24:50,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679308047] [2023-12-02 19:24:50,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679308047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:24:50,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:24:50,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:24:50,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605048558] [2023-12-02 19:24:50,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:24:50,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:24:50,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:24:50,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:24:50,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:50,346 INFO L87 Difference]: Start difference. First operand 1915 states and 3006 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:24:51,719 INFO L93 Difference]: Finished difference Result 3336 states and 5463 transitions. [2023-12-02 19:24:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:24:51,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 19:24:51,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:24:51,744 INFO L225 Difference]: With dead ends: 3336 [2023-12-02 19:24:51,744 INFO L226 Difference]: Without dead ends: 3336 [2023-12-02 19:24:51,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:51,745 INFO L413 NwaCegarLoop]: 2882 mSDtfsCounter, 1506 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 5583 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:24:51,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 5583 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 19:24:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2023-12-02 19:24:52,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3059. [2023-12-02 19:24:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 1603 states have (on average 2.036805988771054) internal successors, (3265), 3052 states have internal predecessors, (3265), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 19:24:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 5273 transitions. [2023-12-02 19:24:52,054 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 5273 transitions. Word has length 10 [2023-12-02 19:24:52,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:24:52,054 INFO L495 AbstractCegarLoop]: Abstraction has 3059 states and 5273 transitions. [2023-12-02 19:24:52,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 5273 transitions. [2023-12-02 19:24:52,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 19:24:52,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:24:52,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:24:52,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-02 19:24:52,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:52,256 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:24:52,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:24:52,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1853929826, now seen corresponding path program 1 times [2023-12-02 19:24:52,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:24:52,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144972978] [2023-12-02 19:24:52,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:24:52,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:52,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:24:52,258 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:24:52,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 19:24:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:24:52,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 19:24:52,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:24:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:24:52,368 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:24:52,368 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:24:52,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144972978] [2023-12-02 19:24:52,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144972978] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:24:52,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:24:52,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:24:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416933420] [2023-12-02 19:24:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:24:52,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:24:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:24:52,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:24:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:52,369 INFO L87 Difference]: Start difference. First operand 3059 states and 5273 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:24:53,166 INFO L93 Difference]: Finished difference Result 3005 states and 5193 transitions. [2023-12-02 19:24:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:24:53,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 19:24:53,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:24:53,183 INFO L225 Difference]: With dead ends: 3005 [2023-12-02 19:24:53,183 INFO L226 Difference]: Without dead ends: 3005 [2023-12-02 19:24:53,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:53,184 INFO L413 NwaCegarLoop]: 2785 mSDtfsCounter, 70 mSDsluCounter, 2736 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 5521 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:24:53,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 5521 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 19:24:53,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2023-12-02 19:24:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 3005. [2023-12-02 19:24:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3005 states, 1573 states have (on average 2.024793388429752) internal successors, (3185), 2998 states have internal predecessors, (3185), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 19:24:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 5193 transitions. [2023-12-02 19:24:53,499 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 5193 transitions. Word has length 12 [2023-12-02 19:24:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:24:53,499 INFO L495 AbstractCegarLoop]: Abstraction has 3005 states and 5193 transitions. [2023-12-02 19:24:53,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 5193 transitions. [2023-12-02 19:24:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 19:24:53,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:24:53,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:24:53,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 19:24:53,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:53,703 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr533ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:24:53,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:24:53,704 INFO L85 PathProgramCache]: Analyzing trace with hash -986754248, now seen corresponding path program 1 times [2023-12-02 19:24:53,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:24:53,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422563170] [2023-12-02 19:24:53,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:24:53,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:53,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:24:53,705 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:24:53,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-02 19:24:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:24:53,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:24:53,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:24:53,846 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:24:53,847 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:24:53,848 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:24:53,851 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 [2023-12-02 19:24:53,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:24:53,904 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 [2023-12-02 19:24:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:24:53,919 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:24:53,919 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:24:53,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422563170] [2023-12-02 19:24:53,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422563170] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:24:53,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:24:53,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:24:53,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992410769] [2023-12-02 19:24:53,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:24:53,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:24:53,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:24:53,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:24:53,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:24:53,921 INFO L87 Difference]: Start difference. First operand 3005 states and 5193 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:57,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:24:57,616 INFO L93 Difference]: Finished difference Result 5296 states and 9516 transitions. [2023-12-02 19:24:57,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:24:57,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 19:24:57,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:24:57,635 INFO L225 Difference]: With dead ends: 5296 [2023-12-02 19:24:57,635 INFO L226 Difference]: Without dead ends: 5296 [2023-12-02 19:24:57,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:24:57,636 INFO L413 NwaCegarLoop]: 2937 mSDtfsCounter, 1308 mSDsluCounter, 5179 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1808 SdHoareTripleChecker+Valid, 8116 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:24:57,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1808 Valid, 8116 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-12-02 19:24:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2023-12-02 19:24:58,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 3004. [2023-12-02 19:24:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 1572 states have (on average 2.0248091603053435) internal successors, (3183), 2997 states have internal predecessors, (3183), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 19:24:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 5191 transitions. [2023-12-02 19:24:58,079 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 5191 transitions. Word has length 13 [2023-12-02 19:24:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:24:58,080 INFO L495 AbstractCegarLoop]: Abstraction has 3004 states and 5191 transitions. [2023-12-02 19:24:58,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 5191 transitions. [2023-12-02 19:24:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 19:24:58,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:24:58,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:24:58,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-02 19:24:58,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:58,282 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:24:58,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:24:58,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1436114350, now seen corresponding path program 1 times [2023-12-02 19:24:58,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:24:58,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739969633] [2023-12-02 19:24:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:24:58,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:58,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:24:58,287 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:24:58,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-02 19:24:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:24:58,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 19:24:58,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:24:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:24:58,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:24:58,473 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:24:58,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739969633] [2023-12-02 19:24:58,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739969633] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:24:58,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:24:58,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:24:58,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435097014] [2023-12-02 19:24:58,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:24:58,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:24:58,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:24:58,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:24:58,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:58,475 INFO L87 Difference]: Start difference. First operand 3004 states and 5191 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:24:59,305 INFO L93 Difference]: Finished difference Result 2950 states and 5111 transitions. [2023-12-02 19:24:59,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:24:59,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2023-12-02 19:24:59,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:24:59,314 INFO L225 Difference]: With dead ends: 2950 [2023-12-02 19:24:59,314 INFO L226 Difference]: Without dead ends: 2950 [2023-12-02 19:24:59,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:24:59,315 INFO L413 NwaCegarLoop]: 2748 mSDtfsCounter, 70 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 5447 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:24:59,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 5447 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 19:24:59,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2023-12-02 19:24:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2950. [2023-12-02 19:24:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 1542 states have (on average 2.0123216601815823) internal successors, (3103), 2943 states have internal predecessors, (3103), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 19:24:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 5111 transitions. [2023-12-02 19:24:59,580 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 5111 transitions. Word has length 15 [2023-12-02 19:24:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:24:59,580 INFO L495 AbstractCegarLoop]: Abstraction has 2950 states and 5111 transitions. [2023-12-02 19:24:59,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:24:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 5111 transitions. [2023-12-02 19:24:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 19:24:59,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:24:59,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:24:59,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-02 19:24:59,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:59,782 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:24:59,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:24:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1421392629, now seen corresponding path program 1 times [2023-12-02 19:24:59,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:24:59,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461345689] [2023-12-02 19:24:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:24:59,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:24:59,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:24:59,784 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:24:59,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-02 19:24:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:24:59,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:24:59,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:24:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:24:59,922 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:24:59,922 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:24:59,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461345689] [2023-12-02 19:24:59,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461345689] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:24:59,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:24:59,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:24:59,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434559732] [2023-12-02 19:24:59,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:24:59,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:24:59,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:24:59,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:24:59,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:24:59,924 INFO L87 Difference]: Start difference. First operand 2950 states and 5111 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:25:00,889 INFO L93 Difference]: Finished difference Result 2936 states and 5069 transitions. [2023-12-02 19:25:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:25:00,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-12-02 19:25:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:25:00,898 INFO L225 Difference]: With dead ends: 2936 [2023-12-02 19:25:00,898 INFO L226 Difference]: Without dead ends: 2936 [2023-12-02 19:25:00,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:25:00,899 INFO L413 NwaCegarLoop]: 2717 mSDtfsCounter, 58 mSDsluCounter, 5410 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 8127 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:25:00,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 8127 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 19:25:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2023-12-02 19:25:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2934. [2023-12-02 19:25:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 1540 states have (on average 1.9863636363636363) internal successors, (3059), 2927 states have internal predecessors, (3059), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 19:25:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5067 transitions. [2023-12-02 19:25:01,126 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5067 transitions. Word has length 17 [2023-12-02 19:25:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:25:01,126 INFO L495 AbstractCegarLoop]: Abstraction has 2934 states and 5067 transitions. [2023-12-02 19:25:01,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5067 transitions. [2023-12-02 19:25:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 19:25:01,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:25:01,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:25:01,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-02 19:25:01,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:01,328 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:25:01,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:25:01,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1482159641, now seen corresponding path program 1 times [2023-12-02 19:25:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:25:01,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298926765] [2023-12-02 19:25:01,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:01,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:01,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:25:01,330 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:25:01,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-02 19:25:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:01,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:25:01,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:01,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:25:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:01,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:25:01,570 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:25:01,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298926765] [2023-12-02 19:25:01,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298926765] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:25:01,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:25:01,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:25:01,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688826901] [2023-12-02 19:25:01,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:25:01,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:25:01,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:25:01,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:25:01,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:25:01,572 INFO L87 Difference]: Start difference. First operand 2934 states and 5067 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:25:05,625 INFO L93 Difference]: Finished difference Result 5138 states and 9327 transitions. [2023-12-02 19:25:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:25:05,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2023-12-02 19:25:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:25:05,636 INFO L225 Difference]: With dead ends: 5138 [2023-12-02 19:25:05,636 INFO L226 Difference]: Without dead ends: 5138 [2023-12-02 19:25:05,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:25:05,637 INFO L413 NwaCegarLoop]: 2469 mSDtfsCounter, 1615 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2118 SdHoareTripleChecker+Valid, 5512 SdHoareTripleChecker+Invalid, 2514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:25:05,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2118 Valid, 5512 Invalid, 2514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2506 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-02 19:25:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2023-12-02 19:25:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 2930. [2023-12-02 19:25:06,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2930 states, 1540 states have (on average 1.9811688311688311) internal successors, (3051), 2923 states have internal predecessors, (3051), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 19:25:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 5059 transitions. [2023-12-02 19:25:06,184 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 5059 transitions. Word has length 31 [2023-12-02 19:25:06,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:25:06,185 INFO L495 AbstractCegarLoop]: Abstraction has 2930 states and 5059 transitions. [2023-12-02 19:25:06,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:06,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 5059 transitions. [2023-12-02 19:25:06,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 19:25:06,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:25:06,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:25:06,213 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-02 19:25:06,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:06,386 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:25:06,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:25:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1482159642, now seen corresponding path program 1 times [2023-12-02 19:25:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:25:06,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663378410] [2023-12-02 19:25:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:06,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:06,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:25:06,389 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:25:06,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-02 19:25:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:06,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:25:06,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:06,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:25:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:06,748 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:25:06,748 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:25:06,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663378410] [2023-12-02 19:25:06,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663378410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:25:06,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:25:06,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:25:06,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63217922] [2023-12-02 19:25:06,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:25:06,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:25:06,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:25:06,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:25:06,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:25:06,750 INFO L87 Difference]: Start difference. First operand 2930 states and 5059 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:25:12,333 INFO L93 Difference]: Finished difference Result 5179 states and 9333 transitions. [2023-12-02 19:25:12,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:25:12,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2023-12-02 19:25:12,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:25:12,342 INFO L225 Difference]: With dead ends: 5179 [2023-12-02 19:25:12,342 INFO L226 Difference]: Without dead ends: 5179 [2023-12-02 19:25:12,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:25:12,343 INFO L413 NwaCegarLoop]: 4802 mSDtfsCounter, 1335 mSDsluCounter, 5788 mSDsCounter, 0 mSdLazyCounter, 2681 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1835 SdHoareTripleChecker+Valid, 10590 SdHoareTripleChecker+Invalid, 2684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:25:12,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1835 Valid, 10590 Invalid, 2684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2681 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-12-02 19:25:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2023-12-02 19:25:12,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 2926. [2023-12-02 19:25:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 1540 states have (on average 1.975974025974026) internal successors, (3043), 2919 states have internal predecessors, (3043), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 19:25:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 5051 transitions. [2023-12-02 19:25:12,718 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 5051 transitions. Word has length 31 [2023-12-02 19:25:12,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:25:12,718 INFO L495 AbstractCegarLoop]: Abstraction has 2926 states and 5051 transitions. [2023-12-02 19:25:12,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:12,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 5051 transitions. [2023-12-02 19:25:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 19:25:12,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:25:12,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:25:12,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-02 19:25:12,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:12,921 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:25:12,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:25:12,921 INFO L85 PathProgramCache]: Analyzing trace with hash 901126845, now seen corresponding path program 1 times [2023-12-02 19:25:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:25:12,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689404647] [2023-12-02 19:25:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:12,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:12,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:25:12,924 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:25:12,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-02 19:25:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:13,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:25:13,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:13,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:25:13,165 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:25:13,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689404647] [2023-12-02 19:25:13,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689404647] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:25:13,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:25:13,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:25:13,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136517036] [2023-12-02 19:25:13,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:25:13,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:25:13,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:25:13,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:25:13,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:25:13,166 INFO L87 Difference]: Start difference. First operand 2926 states and 5051 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:25:14,104 INFO L93 Difference]: Finished difference Result 2914 states and 5031 transitions. [2023-12-02 19:25:14,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:25:14,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-02 19:25:14,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:25:14,114 INFO L225 Difference]: With dead ends: 2914 [2023-12-02 19:25:14,114 INFO L226 Difference]: Without dead ends: 2914 [2023-12-02 19:25:14,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:25:14,115 INFO L413 NwaCegarLoop]: 2711 mSDtfsCounter, 23 mSDsluCounter, 5402 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8113 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:25:14,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 8113 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 19:25:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2023-12-02 19:25:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2914. [2023-12-02 19:25:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 1528 states have (on average 1.9784031413612566) internal successors, (3023), 2907 states have internal predecessors, (3023), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 19:25:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5031 transitions. [2023-12-02 19:25:14,438 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5031 transitions. Word has length 50 [2023-12-02 19:25:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:25:14,438 INFO L495 AbstractCegarLoop]: Abstraction has 2914 states and 5031 transitions. [2023-12-02 19:25:14,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5031 transitions. [2023-12-02 19:25:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 19:25:14,439 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:25:14,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:25:14,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-02 19:25:14,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:14,640 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:25:14,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:25:14,640 INFO L85 PathProgramCache]: Analyzing trace with hash 793308283, now seen corresponding path program 1 times [2023-12-02 19:25:14,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:25:14,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595637514] [2023-12-02 19:25:14,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:14,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:14,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:25:14,642 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:25:14,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-02 19:25:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:14,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 19:25:14,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:14,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:25:14,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:25:15,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:25:15,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 19:25:15,359 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:25:15,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:25:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:15,384 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:25:15,385 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:25:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595637514] [2023-12-02 19:25:15,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595637514] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:25:15,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:25:15,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:25:15,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694861969] [2023-12-02 19:25:15,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:25:15,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:25:15,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:25:15,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:25:15,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:25:15,387 INFO L87 Difference]: Start difference. First operand 2914 states and 5031 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:25:20,556 INFO L93 Difference]: Finished difference Result 5084 states and 9261 transitions. [2023-12-02 19:25:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:25:20,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-02 19:25:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:25:20,571 INFO L225 Difference]: With dead ends: 5084 [2023-12-02 19:25:20,571 INFO L226 Difference]: Without dead ends: 5084 [2023-12-02 19:25:20,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:25:20,572 INFO L413 NwaCegarLoop]: 2346 mSDtfsCounter, 4201 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5204 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:25:20,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5204 Valid, 3524 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-12-02 19:25:20,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5084 states. [2023-12-02 19:25:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5084 to 2853. [2023-12-02 19:25:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 1505 states have (on average 1.9455149501661129) internal successors, (2928), 2846 states have internal predecessors, (2928), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 19:25:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4936 transitions. [2023-12-02 19:25:20,974 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4936 transitions. Word has length 54 [2023-12-02 19:25:20,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:25:20,974 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 4936 transitions. [2023-12-02 19:25:20,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:20,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4936 transitions. [2023-12-02 19:25:20,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-02 19:25:20,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:25:20,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:25:20,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-02 19:25:21,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:21,176 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:25:21,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:25:21,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2056646577, now seen corresponding path program 1 times [2023-12-02 19:25:21,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:25:21,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618374793] [2023-12-02 19:25:21,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:21,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:21,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:25:21,178 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:25:21,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-02 19:25:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:21,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 19:25:21,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:21,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:25:21,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:25:21,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:25:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:21,454 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:25:21,454 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:25:21,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618374793] [2023-12-02 19:25:21,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618374793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:25:21,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:25:21,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:25:21,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289739411] [2023-12-02 19:25:21,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:25:21,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:25:21,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:25:21,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:25:21,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:25:21,456 INFO L87 Difference]: Start difference. First operand 2853 states and 4936 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:25:23,915 INFO L93 Difference]: Finished difference Result 2852 states and 4935 transitions. [2023-12-02 19:25:23,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:25:23,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2023-12-02 19:25:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:25:23,925 INFO L225 Difference]: With dead ends: 2852 [2023-12-02 19:25:23,925 INFO L226 Difference]: Without dead ends: 2852 [2023-12-02 19:25:23,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:25:23,926 INFO L413 NwaCegarLoop]: 2685 mSDtfsCounter, 3 mSDsluCounter, 7102 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9787 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:25:23,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 9787 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-02 19:25:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2023-12-02 19:25:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2023-12-02 19:25:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 1505 states have (on average 1.9448504983388704) internal successors, (2927), 2845 states have internal predecessors, (2927), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 19:25:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4935 transitions. [2023-12-02 19:25:24,112 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4935 transitions. Word has length 58 [2023-12-02 19:25:24,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:25:24,112 INFO L495 AbstractCegarLoop]: Abstraction has 2852 states and 4935 transitions. [2023-12-02 19:25:24,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4935 transitions. [2023-12-02 19:25:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-02 19:25:24,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:25:24,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:25:24,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-02 19:25:24,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:24,314 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:25:24,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:25:24,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2056646578, now seen corresponding path program 1 times [2023-12-02 19:25:24,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:25:24,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160587499] [2023-12-02 19:25:24,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:24,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:24,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:25:24,316 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:25:24,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 19:25:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:24,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 19:25:24,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:24,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:25:24,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 19:25:24,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:25:24,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 19:25:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:24,619 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:25:24,619 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:25:24,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160587499] [2023-12-02 19:25:24,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160587499] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:25:24,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:25:24,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:25:24,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568963749] [2023-12-02 19:25:24,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:25:24,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:25:24,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:25:24,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:25:24,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:25:24,620 INFO L87 Difference]: Start difference. First operand 2852 states and 4935 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:27,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:25:27,649 INFO L93 Difference]: Finished difference Result 2851 states and 4934 transitions. [2023-12-02 19:25:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:25:27,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2023-12-02 19:25:27,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:25:27,655 INFO L225 Difference]: With dead ends: 2851 [2023-12-02 19:25:27,655 INFO L226 Difference]: Without dead ends: 2851 [2023-12-02 19:25:27,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:25:27,655 INFO L413 NwaCegarLoop]: 2685 mSDtfsCounter, 1 mSDsluCounter, 7136 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9821 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:25:27,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9821 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-02 19:25:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2023-12-02 19:25:27,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2851. [2023-12-02 19:25:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 1504 states have (on average 1.9454787234042554) internal successors, (2926), 2844 states have internal predecessors, (2926), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-12-02 19:25:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 4934 transitions. [2023-12-02 19:25:27,866 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 4934 transitions. Word has length 58 [2023-12-02 19:25:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:25:27,867 INFO L495 AbstractCegarLoop]: Abstraction has 2851 states and 4934 transitions. [2023-12-02 19:25:27,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:25:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 4934 transitions. [2023-12-02 19:25:27,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 19:25:27,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:25:27,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:25:27,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 19:25:28,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:28,068 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:25:28,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:25:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash -410114857, now seen corresponding path program 1 times [2023-12-02 19:25:28,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:25:28,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675345808] [2023-12-02 19:25:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:28,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:28,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:25:28,070 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:25:28,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-02 19:25:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:28,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:25:28,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:28,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:25:28,358 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:25:28,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675345808] [2023-12-02 19:25:28,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675345808] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:25:28,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:25:28,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:25:28,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361364092] [2023-12-02 19:25:28,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:25:28,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:25:28,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:25:28,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:25:28,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:25:28,360 INFO L87 Difference]: Start difference. First operand 2851 states and 4934 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:25:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:25:29,302 INFO L93 Difference]: Finished difference Result 2853 states and 4937 transitions. [2023-12-02 19:25:29,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:25:29,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2023-12-02 19:25:29,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:25:29,321 INFO L225 Difference]: With dead ends: 2853 [2023-12-02 19:25:29,321 INFO L226 Difference]: Without dead ends: 2853 [2023-12-02 19:25:29,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:25:29,322 INFO L413 NwaCegarLoop]: 2685 mSDtfsCounter, 1 mSDsluCounter, 5367 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8052 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:25:29,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8052 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 19:25:29,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2023-12-02 19:25:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2853. [2023-12-02 19:25:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 1505 states have (on average 1.9455149501661129) internal successors, (2928), 2846 states have internal predecessors, (2928), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 19:25:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4937 transitions. [2023-12-02 19:25:29,561 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4937 transitions. Word has length 64 [2023-12-02 19:25:29,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:25:29,562 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 4937 transitions. [2023-12-02 19:25:29,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:25:29,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4937 transitions. [2023-12-02 19:25:29,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-02 19:25:29,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:25:29,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:25:29,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-02 19:25:29,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:29,763 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:25:29,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:25:29,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1457343633, now seen corresponding path program 1 times [2023-12-02 19:25:29,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:25:29,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745780005] [2023-12-02 19:25:29,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:29,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:29,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:25:29,766 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:25:29,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-02 19:25:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:30,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:25:30,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:30,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:25:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:30,093 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:25:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745780005] [2023-12-02 19:25:30,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745780005] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:25:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1601732993] [2023-12-02 19:25:30,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:30,094 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:25:30,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:25:30,096 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:25:30,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-02 19:25:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:30,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:25:30,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:30,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:25:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1601732993] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:25:30,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290410276] [2023-12-02 19:25:30,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:25:30,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:25:30,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:25:30,612 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:25:30,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 19:25:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:25:30,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:25:30,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:30,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:25:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:30,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290410276] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:25:30,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 19:25:30,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 19:25:30,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058332187] [2023-12-02 19:25:30,915 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 19:25:30,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:25:30,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:25:30,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:25:30,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:25:30,916 INFO L87 Difference]: Start difference. First operand 2853 states and 4937 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 19:25:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:25:32,566 INFO L93 Difference]: Finished difference Result 2862 states and 4951 transitions. [2023-12-02 19:25:32,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 19:25:32,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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 65 [2023-12-02 19:25:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:25:32,575 INFO L225 Difference]: With dead ends: 2862 [2023-12-02 19:25:32,575 INFO L226 Difference]: Without dead ends: 2862 [2023-12-02 19:25:32,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-12-02 19:25:32,576 INFO L413 NwaCegarLoop]: 2684 mSDtfsCounter, 6 mSDsluCounter, 13411 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16095 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:25:32,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16095 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 19:25:32,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2023-12-02 19:25:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2861. [2023-12-02 19:25:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 1512 states have (on average 1.94510582010582) internal successors, (2941), 2853 states have internal predecessors, (2941), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 19:25:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 4950 transitions. [2023-12-02 19:25:32,792 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 4950 transitions. Word has length 65 [2023-12-02 19:25:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:25:32,792 INFO L495 AbstractCegarLoop]: Abstraction has 2861 states and 4950 transitions. [2023-12-02 19:25:32,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 19:25:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 4950 transitions. [2023-12-02 19:25:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-02 19:25:32,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:25:32,794 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:25:32,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-02 19:25:32,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-12-02 19:25:33,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 19:25:33,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:25:33,394 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:25:33,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:25:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash -705215657, now seen corresponding path program 2 times [2023-12-02 19:25:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:25:33,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282736765] [2023-12-02 19:25:33,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:25:33,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:25:33,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:25:33,397 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:25:33,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-02 19:25:33,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:25:33,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:25:33,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 19:25:33,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:33,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:25:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:34,024 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:25:34,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282736765] [2023-12-02 19:25:34,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282736765] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:25:34,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1459469418] [2023-12-02 19:25:34,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:25:34,024 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:25:34,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:25:34,025 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:25:34,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-02 19:25:35,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:25:35,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:25:35,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 19:25:35,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:25:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:35,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:25:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:25:35,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1459469418] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:25:35,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684149108] [2023-12-02 19:25:35,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:25:35,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:25:35,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:25:35,561 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:25:35,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 19:26:04,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:26:04,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:26:04,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 19:26:04,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:26:04,374 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:26:04,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 [2023-12-02 19:26:04,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:26:04,644 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:26:04,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:26:04,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 19:26:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 19:26:04,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:26:04,861 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 19:26:04,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 25 treesize of output 24 [2023-12-02 19:26:04,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684149108] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:26:04,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 19:26:04,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2023-12-02 19:26:04,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047759255] [2023-12-02 19:26:04,966 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 19:26:04,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 19:26:04,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:26:04,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 19:26:04,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=550, Unknown=9, NotChecked=0, Total=650 [2023-12-02 19:26:04,968 INFO L87 Difference]: Start difference. First operand 2861 states and 4950 transitions. Second operand has 24 states, 21 states have (on average 5.904761904761905) internal successors, (124), 23 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 19:26:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:26:32,124 INFO L93 Difference]: Finished difference Result 5083 states and 9239 transitions. [2023-12-02 19:26:32,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 19:26:32,125 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.904761904761905) internal successors, (124), 23 states have internal predecessors, (124), 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 68 [2023-12-02 19:26:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:26:32,134 INFO L225 Difference]: With dead ends: 5083 [2023-12-02 19:26:32,135 INFO L226 Difference]: Without dead ends: 5081 [2023-12-02 19:26:32,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=458, Invalid=2500, Unknown=12, NotChecked=0, Total=2970 [2023-12-02 19:26:32,136 INFO L413 NwaCegarLoop]: 2451 mSDtfsCounter, 1569 mSDsluCounter, 31887 mSDsCounter, 0 mSdLazyCounter, 18402 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2076 SdHoareTripleChecker+Valid, 34338 SdHoareTripleChecker+Invalid, 19424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 18402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:26:32,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2076 Valid, 34338 Invalid, 19424 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1022 Valid, 18402 Invalid, 0 Unknown, 0 Unchecked, 25.7s Time] [2023-12-02 19:26:32,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2023-12-02 19:26:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 2869. [2023-12-02 19:26:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 1521 states have (on average 1.9408284023668638) internal successors, (2952), 2861 states have internal predecessors, (2952), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 19:26:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 4961 transitions. [2023-12-02 19:26:32,754 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 4961 transitions. Word has length 68 [2023-12-02 19:26:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:26:32,755 INFO L495 AbstractCegarLoop]: Abstraction has 2869 states and 4961 transitions. [2023-12-02 19:26:32,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.904761904761905) internal successors, (124), 23 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 19:26:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 4961 transitions. [2023-12-02 19:26:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-02 19:26:32,756 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:26:32,756 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:26:32,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 19:26:32,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-12-02 19:26:33,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-12-02 19:26:33,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:26:33,357 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:26:33,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:26:33,358 INFO L85 PathProgramCache]: Analyzing trace with hash -205072104, now seen corresponding path program 1 times [2023-12-02 19:26:33,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:26:33,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92724724] [2023-12-02 19:26:33,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:26:33,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:26:33,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:26:33,360 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:26:33,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-02 19:26:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:26:33,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 19:26:33,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:26:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:26:33,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:26:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:26:34,234 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:26:34,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92724724] [2023-12-02 19:26:34,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92724724] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:26:34,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1753547505] [2023-12-02 19:26:34,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:26:34,234 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:26:34,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:26:34,235 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:26:34,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-12-02 19:26:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:26:34,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 19:26:34,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:26:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:26:34,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:26:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:26:34,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1753547505] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:26:34,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390640504] [2023-12-02 19:26:34,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:26:34,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:26:34,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:26:34,950 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:26:34,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 19:26:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:26:35,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 19:26:35,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:26:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:26:35,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:26:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:26:36,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390640504] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:26:36,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 19:26:36,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 19:26:36,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154092631] [2023-12-02 19:26:36,022 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 19:26:36,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 19:26:36,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:26:36,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 19:26:36,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 19:26:36,024 INFO L87 Difference]: Start difference. First operand 2869 states and 4961 transitions. Second operand has 38 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 38 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 19:26:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:26:41,613 INFO L93 Difference]: Finished difference Result 2899 states and 5006 transitions. [2023-12-02 19:26:41,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 19:26:41,613 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 38 states have internal predecessors, (97), 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 74 [2023-12-02 19:26:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:26:41,619 INFO L225 Difference]: With dead ends: 2899 [2023-12-02 19:26:41,619 INFO L226 Difference]: Without dead ends: 2896 [2023-12-02 19:26:41,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 19:26:41,622 INFO L413 NwaCegarLoop]: 2682 mSDtfsCounter, 27 mSDsluCounter, 29491 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 32173 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:26:41,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 32173 Invalid, 1839 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-02 19:26:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2023-12-02 19:26:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 2887. [2023-12-02 19:26:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 1539 states have (on average 1.9330734243014944) internal successors, (2975), 2879 states have internal predecessors, (2975), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 19:26:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 4984 transitions. [2023-12-02 19:26:41,948 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 4984 transitions. Word has length 74 [2023-12-02 19:26:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:26:41,948 INFO L495 AbstractCegarLoop]: Abstraction has 2887 states and 4984 transitions. [2023-12-02 19:26:41,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 38 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 19:26:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 4984 transitions. [2023-12-02 19:26:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 19:26:41,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:26:41,949 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:26:41,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-12-02 19:26:42,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-12-02 19:26:42,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-12-02 19:26:42,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:26:42,550 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:26:42,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:26:42,551 INFO L85 PathProgramCache]: Analyzing trace with hash -337898344, now seen corresponding path program 2 times [2023-12-02 19:26:42,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:26:42,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638098583] [2023-12-02 19:26:42,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:26:42,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:26:42,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:26:42,552 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:26:42,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-02 19:26:43,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:26:43,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:26:43,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:26:43,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:26:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:26:43,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:26:45,808 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:26:45,808 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:26:45,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638098583] [2023-12-02 19:26:45,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638098583] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:26:45,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1475317109] [2023-12-02 19:26:45,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:26:45,809 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:26:45,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:26:45,809 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:26:45,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-02 19:26:47,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:26:47,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:26:47,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:26:47,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:26:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:26:47,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:26:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:26:48,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1475317109] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:26:48,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603759081] [2023-12-02 19:26:48,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:26:48,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:26:48,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:26:48,087 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:26:48,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 19:27:12,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:27:12,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:27:13,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 19:27:13,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:27:13,202 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:27:13,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:27:13,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:27:13,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:27:13,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 19:27:13,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 19:27:13,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 19:27:14,291 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:27:14,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 19:27:14,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:27:14,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 19:27:14,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 19:27:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-02 19:27:14,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:27:15,445 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2921 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-12-02 19:27:15,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603759081] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:27:15,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 19:27:15,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2023-12-02 19:27:15,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886104538] [2023-12-02 19:27:15,453 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 19:27:15,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-02 19:27:15,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:27:15,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-02 19:27:15,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2023-12-02 19:27:15,457 INFO L87 Difference]: Start difference. First operand 2887 states and 4984 transitions. Second operand has 58 states, 55 states have (on average 2.909090909090909) internal successors, (160), 58 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 19:27:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:27:59,712 INFO L93 Difference]: Finished difference Result 5157 states and 9354 transitions. [2023-12-02 19:27:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-12-02 19:27:59,712 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 2.909090909090909) internal successors, (160), 58 states have internal predecessors, (160), 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 86 [2023-12-02 19:27:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:27:59,726 INFO L225 Difference]: With dead ends: 5157 [2023-12-02 19:27:59,726 INFO L226 Difference]: Without dead ends: 5150 [2023-12-02 19:27:59,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 371 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3826 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=3457, Invalid=16568, Unknown=1, NotChecked=280, Total=20306 [2023-12-02 19:27:59,732 INFO L413 NwaCegarLoop]: 2458 mSDtfsCounter, 1599 mSDsluCounter, 69360 mSDsCounter, 0 mSdLazyCounter, 17137 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 71818 SdHoareTripleChecker+Invalid, 17223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 17137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:27:59,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2133 Valid, 71818 Invalid, 17223 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [86 Valid, 17137 Invalid, 0 Unknown, 0 Unchecked, 32.7s Time] [2023-12-02 19:27:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2023-12-02 19:28:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 2922. [2023-12-02 19:28:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 1575 states have (on average 1.9161904761904762) internal successors, (3018), 2914 states have internal predecessors, (3018), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 19:28:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 5027 transitions. [2023-12-02 19:28:00,457 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 5027 transitions. Word has length 86 [2023-12-02 19:28:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:28:00,458 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 5027 transitions. [2023-12-02 19:28:00,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 2.909090909090909) internal successors, (160), 58 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 19:28:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 5027 transitions. [2023-12-02 19:28:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 19:28:00,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:28:00,459 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:28:00,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-12-02 19:28:00,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-02 19:28:00,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-12-02 19:28:01,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 19:28:01,060 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:28:01,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:28:01,061 INFO L85 PathProgramCache]: Analyzing trace with hash -823962797, now seen corresponding path program 1 times [2023-12-02 19:28:01,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:28:01,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344311724] [2023-12-02 19:28:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:28:01,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:28:01,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:28:01,063 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:28:01,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-02 19:28:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:28:01,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 19:28:01,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:28:01,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:28:01,958 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 19:28:01,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 19:28:01,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:28:02,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 19:28:02,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:28:02,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:28:03,065 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:28:03,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:28:03,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 19:28:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:28:03,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:28:03,161 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3345 (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_3345) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-12-02 19:28:03,171 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3345) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 19:28:03,588 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3391))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3345)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:28:03,590 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:28:03,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344311724] [2023-12-02 19:28:03,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344311724] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:28:03,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1984405697] [2023-12-02 19:28:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:28:03,591 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:28:03,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:28:03,592 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:28:03,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-02 19:28:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:28:05,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 19:28:05,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:28:05,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:28:06,158 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 19:28:06,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 19:28:06,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:28:06,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 20 treesize of output 12 [2023-12-02 19:28:07,142 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:28:07,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 19:28:07,276 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:28:07,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 19:28:07,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 19:28:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:28:07,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:28:09,372 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3815 (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_3815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-12-02 19:28:09,762 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3861))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3815)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:28:09,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1984405697] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:28:09,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861947379] [2023-12-02 19:28:09,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:28:09,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:28:09,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:28:09,765 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:28:09,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 19:28:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:28:10,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 19:28:10,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:28:10,419 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:28:10,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:28:10,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:28:11,095 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:28:11,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:28:11,258 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:28:11,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:28:11,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 19:28:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:28:11,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:28:11,289 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-12-02 19:28:11,301 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4283 (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_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:28:11,750 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 19:28:11,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2023-12-02 19:28:11,759 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4283 (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~mem38#1.base| v_ArrVal_4329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4283)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem38#1.base|)) is different from false [2023-12-02 19:28:11,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861947379] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:28:11,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:28:11,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 23 [2023-12-02 19:28:11,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236622560] [2023-12-02 19:28:11,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:28:11,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 19:28:11,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:28:11,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 19:28:11,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=543, Unknown=13, NotChecked=440, Total=1122 [2023-12-02 19:28:11,763 INFO L87 Difference]: Start difference. First operand 2922 states and 5027 transitions. Second operand has 24 states, 20 states have (on average 7.1) internal successors, (142), 23 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 19:28:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:28:38,980 INFO L93 Difference]: Finished difference Result 5130 states and 9295 transitions. [2023-12-02 19:28:38,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 19:28:38,981 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 7.1) internal successors, (142), 23 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 110 [2023-12-02 19:28:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:28:38,996 INFO L225 Difference]: With dead ends: 5130 [2023-12-02 19:28:38,996 INFO L226 Difference]: Without dead ends: 5130 [2023-12-02 19:28:38,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 310 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=149, Invalid=682, Unknown=13, NotChecked=488, Total=1332 [2023-12-02 19:28:38,998 INFO L413 NwaCegarLoop]: 2450 mSDtfsCounter, 2957 mSDsluCounter, 19004 mSDsCounter, 0 mSdLazyCounter, 15147 mSolverCounterSat, 1518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3460 SdHoareTripleChecker+Valid, 21454 SdHoareTripleChecker+Invalid, 16665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1518 IncrementalHoareTripleChecker+Valid, 15147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:28:38,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3460 Valid, 21454 Invalid, 16665 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1518 Valid, 15147 Invalid, 0 Unknown, 0 Unchecked, 26.7s Time] [2023-12-02 19:28:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5130 states. [2023-12-02 19:28:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5130 to 2921. [2023-12-02 19:28:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 1575 states have (on average 1.9155555555555555) internal successors, (3017), 2913 states have internal predecessors, (3017), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 19:28:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 5026 transitions. [2023-12-02 19:28:39,686 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 5026 transitions. Word has length 110 [2023-12-02 19:28:39,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:28:39,687 INFO L495 AbstractCegarLoop]: Abstraction has 2921 states and 5026 transitions. [2023-12-02 19:28:39,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 7.1) internal successors, (142), 23 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 19:28:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 5026 transitions. [2023-12-02 19:28:39,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 19:28:39,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:28:39,688 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:28:39,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-12-02 19:28:39,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 19:28:40,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-12-02 19:28:40,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -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_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 19:28:40,289 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:28:40,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:28:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash -823962796, now seen corresponding path program 1 times [2023-12-02 19:28:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:28:40,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586711938] [2023-12-02 19:28:40,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:28:40,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:28:40,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:28:40,293 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:28:40,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-12-02 19:28:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:28:41,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 19:28:41,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:28:41,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:28:41,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:28:41,377 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:28:41,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:28:41,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:28:41,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:28:41,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 19:28:41,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:28:42,216 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:28:42,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:28:42,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:28:42,333 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:28:42,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:28:42,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:28:42,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 19:28:42,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:28:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:28:42,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:28:42,549 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4798) |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_4799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:28:42,585 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-12-02 19:28:44,080 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4890))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4891) .cse0 v_ArrVal_4798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4891 (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_4891) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 19:28:44,089 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:28:44,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586711938] [2023-12-02 19:28:44,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586711938] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:28:44,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1982333952] [2023-12-02 19:28:44,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:28:44,090 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:28:44,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:28:44,091 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:28:44,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-12-02 19:30:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:36,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 19:30:36,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:36,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:30:36,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:30:36,476 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:30:36,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:30:36,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:30:36,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:30:36,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 19:30:36,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:30:37,158 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:30:37,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:30:37,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:30:37,236 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:30:37,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:30:37,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:30:37,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 19:30:37,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:30:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:30:37,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:30:37,319 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5361) |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_5360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 19:30:37,356 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 19:30:38,686 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5452))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5453) .cse0 v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5453 (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_5453) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 19:30:38,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1982333952] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:38,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71209160] [2023-12-02 19:30:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:38,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:38,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:38,696 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:38,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 19:30:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:39,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 110 conjunts are in the unsatisfiable core [2023-12-02 19:30:39,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:39,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:30:39,369 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:30:39,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:30:39,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:30:39,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 19:30:39,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 19:30:39,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 19:30:40,248 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:30:40,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 19:30:40,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:30:40,415 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:30:40,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 19:30:40,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:30:40,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 19:30:40,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 19:30:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:30:40,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:30:40,506 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5922 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5921) |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_5922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 19:30:40,538 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5922 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 19:30:41,857 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6014 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6013))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6014) .cse0 v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6014 (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_6014) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 19:30:41,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71209160] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:41,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:30:41,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-12-02 19:30:41,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044941123] [2023-12-02 19:30:41,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:30:41,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 19:30:41,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:30:41,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 19:30:41,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=231, Unknown=9, NotChecked=342, Total=650 [2023-12-02 19:30:41,869 INFO L87 Difference]: Start difference. First operand 2921 states and 5026 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 19:31:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:31:03,834 INFO L93 Difference]: Finished difference Result 5128 states and 9293 transitions. [2023-12-02 19:31:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 19:31:03,835 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-12-02 19:31:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:31:03,848 INFO L225 Difference]: With dead ends: 5128 [2023-12-02 19:31:03,848 INFO L226 Difference]: Without dead ends: 5128 [2023-12-02 19:31:03,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 316 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=378, Unknown=9, NotChecked=432, Total=930 [2023-12-02 19:31:03,849 INFO L413 NwaCegarLoop]: 2458 mSDtfsCounter, 2962 mSDsluCounter, 19733 mSDsCounter, 0 mSdLazyCounter, 10797 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3464 SdHoareTripleChecker+Valid, 22191 SdHoareTripleChecker+Invalid, 11312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 10797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:31:03,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3464 Valid, 22191 Invalid, 11312 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [515 Valid, 10797 Invalid, 0 Unknown, 0 Unchecked, 21.5s Time] [2023-12-02 19:31:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5128 states. [2023-12-02 19:31:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5128 to 2920. [2023-12-02 19:31:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 1575 states have (on average 1.914920634920635) internal successors, (3016), 2912 states have internal predecessors, (3016), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 19:31:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 5025 transitions. [2023-12-02 19:31:04,460 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 5025 transitions. Word has length 110 [2023-12-02 19:31:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:31:04,460 INFO L495 AbstractCegarLoop]: Abstraction has 2920 states and 5025 transitions. [2023-12-02 19:31:04,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 19:31:04,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 5025 transitions. [2023-12-02 19:31:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 19:31:04,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:31:04,461 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:31:04,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-12-02 19:31:04,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-12-02 19:31:04,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-12-02 19:31:05,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:31:05,063 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:31:05,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:31:05,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1549069974, now seen corresponding path program 1 times [2023-12-02 19:31:05,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:31:05,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806688745] [2023-12-02 19:31:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:31:05,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:31:05,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:31:05,066 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:31:05,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-02 19:31:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:31:05,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 19:31:05,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:31:05,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:31:06,060 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 19:31:06,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 19:31:06,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:31:06,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 19:31:07,036 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:31:07,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:31:07,163 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:31:07,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:31:07,243 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:31:07,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:31:07,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 19:31:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:31:07,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:31:07,344 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6454) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:31:07,354 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 19:31:07,367 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6453))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6454)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:31:07,380 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6453))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6454)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:31:07,709 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6500))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6453)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6454)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:31:07,713 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:31:07,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806688745] [2023-12-02 19:31:07,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806688745] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:31:07,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [434712161] [2023-12-02 19:31:07,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:31:07,713 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:31:07,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:31:07,714 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:31:07,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-12-02 19:31:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:31:57,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-02 19:31:57,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:31:57,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:31:57,724 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 19:31:57,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 19:31:57,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:31:57,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:31:58,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-02 19:31:58,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:31:59,054 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:31:59,055 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 52 treesize of output 47 [2023-12-02 19:31:59,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:31:59,259 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:31:59,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 52 treesize of output 47 [2023-12-02 19:31:59,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:31:59,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:31:59,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2023-12-02 19:31:59,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 19:31:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:31:59,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:31:59,502 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse3 (bvadd |c_ULTIMATE.start_main_#t~mem41#1.offset| (_ bv7 32)))) (store (let ((.cse2 (bvadd |c_ULTIMATE.start_main_#t~mem41#1.offset| (_ bv6 32)))) (store (let ((.cse1 (bvadd |c_ULTIMATE.start_main_#t~mem41#1.offset| (_ bv5 32)))) (store (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_#t~mem41#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base|) .cse0 (select v_ArrVal_6987 .cse0))) .cse1 (select v_ArrVal_6987 .cse1))) .cse2 (select v_ArrVal_6987 .cse2))) .cse3 (select v_ArrVal_6987 .cse3))) v_ArrVal_6987)) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6987) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))))) is different from false [2023-12-02 19:31:59,578 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6987 (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))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= v_ArrVal_6987 (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (bvadd .cse3 (_ bv7 32)))) (store (let ((.cse5 (bvadd .cse3 (_ bv6 32)))) (store (let ((.cse4 (bvadd .cse3 (_ bv5 32)))) (store (let ((.cse2 (bvadd (_ bv4 32) .cse3))) (store (select |c_#memory_$Pointer$.base| .cse0) .cse2 (select v_ArrVal_6987 .cse2))) .cse4 (select v_ArrVal_6987 .cse4))) .cse5 (select v_ArrVal_6987 .cse5))) .cse6 (select v_ArrVal_6987 .cse6)))))))))) is different from false [2023-12-02 19:31:59,636 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6985 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6985)) (.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))) (or (= (bvadd (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_6987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (_ bv1 1)) (_ bv0 1)) (not (= (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse7 (bvadd .cse4 (_ bv7 32)))) (store (let ((.cse6 (bvadd (_ bv6 32) .cse4))) (store (let ((.cse5 (bvadd .cse4 (_ bv5 32)))) (store (let ((.cse3 (bvadd (_ bv4 32) .cse4))) (store (select .cse0 .cse1) .cse3 (select v_ArrVal_6987 .cse3))) .cse5 (select v_ArrVal_6987 .cse5))) .cse6 (select v_ArrVal_6987 .cse6))) .cse7 (select v_ArrVal_6987 .cse7)))) v_ArrVal_6987)))))) is different from false [2023-12-02 19:31:59,744 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6985 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_6985))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= (bvadd (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_6987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (_ bv1 1)) (_ bv0 1)) (not (= (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_6984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse7 (bvadd (_ bv7 32) .cse4))) (store (let ((.cse6 (bvadd (_ bv6 32) .cse4))) (store (let ((.cse5 (bvadd (_ bv5 32) .cse4))) (store (let ((.cse3 (bvadd (_ bv4 32) .cse4))) (store (select .cse0 .cse1) .cse3 (select v_ArrVal_6987 .cse3))) .cse5 (select v_ArrVal_6987 .cse5))) .cse6 (select v_ArrVal_6987 .cse6))) .cse7 (select v_ArrVal_6987 .cse7)))) v_ArrVal_6987)))))))) is different from false [2023-12-02 19:32:01,190 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6985 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7080)) (.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse0 (store .cse9 .cse7 v_ArrVal_6985))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (or (not (= v_ArrVal_6987 (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7081) .cse7 v_ArrVal_6984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse6 (bvadd .cse3 (_ bv7 32)))) (store (let ((.cse5 (bvadd (_ bv6 32) .cse3))) (store (let ((.cse4 (bvadd .cse3 (_ bv5 32)))) (store (let ((.cse2 (bvadd (_ bv4 32) .cse3))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_6987 .cse2))) .cse4 (select v_ArrVal_6987 .cse4))) .cse5 (select v_ArrVal_6987 .cse5))) .cse6 (select v_ArrVal_6987 .cse6)))))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_6987) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (_ bv0 1)))))))) is different from false [2023-12-02 19:32:01,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [434712161] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:32:01,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727561088] [2023-12-02 19:32:01,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:32:01,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:32:01,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:32:01,226 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:32:01,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-12-02 19:32:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:32:01,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 19:32:01,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:32:01,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:32:02,021 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:32:02,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:32:02,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:32:02,493 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:32:02,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 19:32:02,580 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:32:02,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 19:32:02,670 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:32:02,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 44 treesize of output 43 [2023-12-02 19:32:02,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 19:32:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:32:02,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:32:02,759 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 19:32:02,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-12-02 19:32:02,768 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem41#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7520) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2023-12-02 19:32:02,778 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7520 (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_7520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 19:32:02,790 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7519)) (.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_7520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 19:32:02,801 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7520 (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_7519))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_7520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 19:32:03,224 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7520 (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_7566))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7519)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_7520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 19:32:03,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727561088] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:32:03,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:32:03,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2023-12-02 19:32:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141696848] [2023-12-02 19:32:03,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:32:03,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 19:32:03,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:32:03,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 19:32:03,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=739, Unknown=15, NotChecked=1050, Total=1980 [2023-12-02 19:32:03,230 INFO L87 Difference]: Start difference. First operand 2920 states and 5025 transitions. Second operand has 29 states, 25 states have (on average 5.92) internal successors, (148), 29 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 19:32:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:32:44,267 INFO L93 Difference]: Finished difference Result 5128 states and 9293 transitions. [2023-12-02 19:32:44,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 19:32:44,267 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 5.92) internal successors, (148), 29 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 112 [2023-12-02 19:32:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:32:44,277 INFO L225 Difference]: With dead ends: 5128 [2023-12-02 19:32:44,277 INFO L226 Difference]: Without dead ends: 5128 [2023-12-02 19:32:44,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 312 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=201, Invalid=836, Unknown=15, NotChecked=1110, Total=2162 [2023-12-02 19:32:44,279 INFO L413 NwaCegarLoop]: 2450 mSDtfsCounter, 1507 mSDsluCounter, 21563 mSDsCounter, 0 mSdLazyCounter, 15900 mSolverCounterSat, 1011 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 24013 SdHoareTripleChecker+Invalid, 16911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1011 IncrementalHoareTripleChecker+Valid, 15900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:32:44,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 24013 Invalid, 16911 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1011 Valid, 15900 Invalid, 0 Unknown, 0 Unchecked, 40.4s Time] [2023-12-02 19:32:44,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5128 states. [2023-12-02 19:32:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5128 to 2919. [2023-12-02 19:32:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 1575 states have (on average 1.9142857142857144) internal successors, (3015), 2911 states have internal predecessors, (3015), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 19:32:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 5024 transitions. [2023-12-02 19:32:44,884 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 5024 transitions. Word has length 112 [2023-12-02 19:32:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:32:44,885 INFO L495 AbstractCegarLoop]: Abstraction has 2919 states and 5024 transitions. [2023-12-02 19:32:44,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 5.92) internal successors, (148), 29 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 19:32:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 5024 transitions. [2023-12-02 19:32:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 19:32:44,885 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:32:44,885 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:32:44,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-12-02 19:32:45,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2023-12-02 19:32:45,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2023-12-02 19:32:45,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -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_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 19:32:45,486 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:32:45,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:32:45,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1549069973, now seen corresponding path program 1 times [2023-12-02 19:32:45,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:32:45,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352668177] [2023-12-02 19:32:45,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:32:45,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:32:45,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:32:45,489 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:32:45,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-12-02 19:32:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:32:46,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 19:32:46,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:32:46,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:32:46,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:32:46,787 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:32:46,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:32:46,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:32:46,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:32:46,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 19:32:46,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:32:47,660 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:32:47,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:32:47,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:32:47,790 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:32:47,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:32:47,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:32:47,897 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:32:47,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:32:47,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:32:47,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 19:32:47,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:32:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:32:47,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:32:48,142 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:32:48,177 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2023-12-02 19:32:48,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8050))) (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~mem40#1.base| v_ArrVal_8051) .cse0 v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8051) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 19:32:50,407 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8145 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8145))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8050))) (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_8144) .cse0 v_ArrVal_8051) .cse1 v_ArrVal_8052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8145 (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_8145))) (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_8144) .cse6 v_ArrVal_8051) (select (select (store .cse7 .cse6 v_ArrVal_8050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8052))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 19:32:50,420 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:32:50,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352668177] [2023-12-02 19:32:50,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352668177] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:32:50,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [14178824] [2023-12-02 19:32:50,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:32:50,420 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:32:50,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:32:50,421 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:32:50,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-12-02 19:33:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:33:48,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 19:33:48,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:33:48,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:33:48,912 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:33:48,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:33:48,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:33:48,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:33:48,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:33:49,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 19:33:49,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:33:50,179 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:33:50,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:33:50,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:33:50,335 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:33:50,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:33:50,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:33:50,439 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:33:50,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:33:50,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:33:50,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 19:33:50,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:33:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:33:50,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:33:50,575 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8631 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:33:50,623 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8631 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2023-12-02 19:33:50,711 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8629) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8630))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8629) .cse2 v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 19:33:50,872 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8629) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8630))) (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_8629) .cse3 v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 19:33:54,539 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8630 (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_8724))) (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_8723) .cse1 v_ArrVal_8629) (select (select (store .cse2 .cse1 v_ArrVal_8630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8632))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8724))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8630))) (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_8723) .cse4 v_ArrVal_8629) .cse5 v_ArrVal_8632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 19:33:54,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [14178824] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:33:54,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600126816] [2023-12-02 19:33:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:33:54,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:33:54,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:33:54,559 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:33:54,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-12-02 19:33:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:33:55,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 19:33:55,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:33:55,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:33:55,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:33:55,693 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:33:55,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:33:55,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:33:55,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 19:33:56,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 19:33:56,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 19:33:57,525 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:33:57,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 19:33:57,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:33:57,846 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:33:57,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 19:33:57,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:33:58,050 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:33:58,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 19:33:58,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:33:58,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 19:33:58,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 19:33:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:33:58,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:33:58,196 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9211) |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~mem41#1.base| v_ArrVal_9210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 19:33:58,246 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 19:33:58,307 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9209))) (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~mem40#1.base| v_ArrVal_9208) .cse0 v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9208) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9209) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 19:33:58,366 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9208) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9209) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9209))) (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_9208) .cse3 v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 19:34:00,196 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9302 (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_9303))) (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_9302) .cse1 v_ArrVal_9208) (select (select (store .cse2 .cse1 v_ArrVal_9209) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9211))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9302 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9303))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9209))) (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_9302) .cse4 v_ArrVal_9208) .cse5 v_ArrVal_9211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 19:34:00,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600126816] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:34:00,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:34:00,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2023-12-02 19:34:00,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513501465] [2023-12-02 19:34:00,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:34:00,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 19:34:00,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:34:00,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 19:34:00,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=319, Unknown=19, NotChecked=686, Total=1122 [2023-12-02 19:34:00,225 INFO L87 Difference]: Start difference. First operand 2919 states and 5024 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 19:34:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:34:38,324 INFO L93 Difference]: Finished difference Result 5126 states and 9291 transitions. [2023-12-02 19:34:38,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 19:34:38,325 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2023-12-02 19:34:38,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:34:38,335 INFO L225 Difference]: With dead ends: 5126 [2023-12-02 19:34:38,335 INFO L226 Difference]: Without dead ends: 5126 [2023-12-02 19:34:38,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 320 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=156, Invalid=530, Unknown=20, NotChecked=854, Total=1560 [2023-12-02 19:34:38,336 INFO L413 NwaCegarLoop]: 2458 mSDtfsCounter, 2955 mSDsluCounter, 17984 mSDsCounter, 0 mSdLazyCounter, 9751 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3457 SdHoareTripleChecker+Valid, 20442 SdHoareTripleChecker+Invalid, 10266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 9751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:34:38,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3457 Valid, 20442 Invalid, 10266 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [515 Valid, 9751 Invalid, 0 Unknown, 0 Unchecked, 37.1s Time] [2023-12-02 19:34:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2023-12-02 19:34:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 2918. [2023-12-02 19:34:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 1575 states have (on average 1.9136507936507936) internal successors, (3014), 2910 states have internal predecessors, (3014), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-12-02 19:34:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 5023 transitions. [2023-12-02 19:34:38,973 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 5023 transitions. Word has length 112 [2023-12-02 19:34:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:34:38,973 INFO L495 AbstractCegarLoop]: Abstraction has 2918 states and 5023 transitions. [2023-12-02 19:34:38,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 19:34:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 5023 transitions. [2023-12-02 19:34:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-02 19:34:38,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:34:38,974 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:34:38,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2023-12-02 19:34:39,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-12-02 19:34:39,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-12-02 19:34:39,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -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_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 19:34:39,575 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-12-02 19:34:39,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:34:39,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1702596636, now seen corresponding path program 1 times [2023-12-02 19:34:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:34:39,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530158160] [2023-12-02 19:34:39,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:39,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:34:39,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:34:39,577 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:34:39,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-12-02 19:34:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:34:40,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 118 conjunts are in the unsatisfiable core [2023-12-02 19:34:40,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:34:40,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:34:41,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:34:41,108 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:34:41,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 13 treesize of output 13 [2023-12-02 19:34:41,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 19:34:41,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:34:41,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 19:34:41,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 19:34:42,537 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:34:42,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 19:34:42,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:34:42,744 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:34:42,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 19:34:42,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:34:42,910 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:34:42,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 19:34:42,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:34:43,082 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:34:43,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 19:34:43,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:34:43,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 19:34:43,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 19:34:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:34:43,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:34:43,443 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:34:43,492 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-12-02 19:34:43,549 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9804))) (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~mem41#1.base| v_ArrVal_9805) .cse0 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9805) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-12-02 19:34:43,615 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9805) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9804))) (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_9805) .cse3 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 19:34:43,794 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9803))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9804))) (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~mem40#1.base| v_ArrVal_9802) .cse0 v_ArrVal_9805) .cse1 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9803))) (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~mem40#1.base| v_ArrVal_9802) .cse6 v_ArrVal_9805) (select (select (store .cse7 .cse6 v_ArrVal_9804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9807))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-12-02 19:34:43,905 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9802) .cse2 v_ArrVal_9805) (select (select (store .cse3 .cse2 v_ArrVal_9804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9807))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9803))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9804))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9802) .cse5 v_ArrVal_9805) .cse6 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 19:34:45,753 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9899 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9898 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9899))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9803))) (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~mem38#1.base| v_ArrVal_9898) .cse1 v_ArrVal_9802) .cse2 v_ArrVal_9805) (select (select (store .cse3 .cse2 v_ArrVal_9804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9807))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9899 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9898 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9899))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9803))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9804))) (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~mem38#1.base| v_ArrVal_9898) .cse6 v_ArrVal_9802) .cse7 v_ArrVal_9805) .cse8 v_ArrVal_9807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-12-02 19:34:45,781 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:34:45,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530158160] [2023-12-02 19:34:45,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530158160] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:34:45,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [957697603] [2023-12-02 19:34:45,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:45,781 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:34:45,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:34:45,782 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:34:45,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20600cfa-42d6-4059-8e70-aca1a4214f55/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process