./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/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_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/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_8b09f27d-07c5-49dc-91d3-faeb98b9705c/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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:44:26,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:44:27,062 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 17:44:27,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:44:27,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:44:27,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:44:27,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:44:27,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:44:27,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:44:27,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:44:27,113 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:44:27,114 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:44:27,114 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:44:27,115 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 17:44:27,115 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:44:27,116 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:44:27,117 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 17:44:27,117 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 17:44:27,118 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:44:27,118 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 17:44:27,119 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 17:44:27,120 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 17:44:27,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 17:44:27,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 17:44:27,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:44:27,122 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:44:27,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:44:27,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:44:27,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:44:27,124 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 17:44:27,124 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 17:44:27,125 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 17:44:27,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:44:27,126 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 17:44:27,126 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 17:44:27,126 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:44:27,127 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:44:27,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:44:27,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:44:27,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:44:27,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:44:27,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:44:27,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:44:27,129 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 17:44:27,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 17:44:27,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:44:27,129 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:44:27,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:44:27,130 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_8b09f27d-07c5-49dc-91d3-faeb98b9705c/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_8b09f27d-07c5-49dc-91d3-faeb98b9705c/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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2023-12-02 17:44:27,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:44:27,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:44:27,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:44:27,451 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:44:27,452 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:44:27,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2023-12-02 17:44:30,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:44:30,564 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:44:30,564 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2023-12-02 17:44:30,583 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/data/e22fd5280/cdfbb312314845418a50bfaac79daf53/FLAGc4a197f83 [2023-12-02 17:44:30,595 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/data/e22fd5280/cdfbb312314845418a50bfaac79daf53 [2023-12-02 17:44:30,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:44:30,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:44:30,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:44:30,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:44:30,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:44:30,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:44:30" (1/1) ... [2023-12-02 17:44:30,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36dadbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:30, skipping insertion in model container [2023-12-02 17:44:30,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:44:30" (1/1) ... [2023-12-02 17:44:30,673 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:44:31,135 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:44:31,147 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 17:44:31,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3c79ac48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:31, skipping insertion in model container [2023-12-02 17:44:31,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:44:31,149 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 17:44:31,150 INFO L158 Benchmark]: Toolchain (without parser) took 550.58ms. Allocated memory is still 155.2MB. Free memory was 122.0MB in the beginning and 101.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 17:44:31,151 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:44:31,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.88ms. Allocated memory is still 155.2MB. Free memory was 122.0MB in the beginning and 101.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 17:44:31,153 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.16ms. Allocated memory is still 115.3MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.88ms. Allocated memory is still 155.2MB. Free memory was 122.0MB in the beginning and 101.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 740]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/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_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/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_8b09f27d-07c5-49dc-91d3-faeb98b9705c/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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:44:32,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:44:33,024 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 17:44:33,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:44:33,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:44:33,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:44:33,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:44:33,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:44:33,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:44:33,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:44:33,062 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:44:33,063 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:44:33,063 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:44:33,064 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:44:33,064 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:44:33,065 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:44:33,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 17:44:33,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 17:44:33,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:44:33,067 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:44:33,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:44:33,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:44:33,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:44:33,069 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 17:44:33,069 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 17:44:33,070 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 17:44:33,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:44:33,070 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 17:44:33,071 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 17:44:33,071 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 17:44:33,072 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 17:44:33,072 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:44:33,072 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:44:33,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:44:33,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 17:44:33,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:44:33,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:44:33,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:44:33,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:44:33,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:44:33,074 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 17:44:33,075 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 17:44:33,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:44:33,075 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:44:33,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:44:33,075 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_8b09f27d-07c5-49dc-91d3-faeb98b9705c/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_8b09f27d-07c5-49dc-91d3-faeb98b9705c/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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2023-12-02 17:44:33,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:44:33,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:44:33,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:44:33,365 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:44:33,365 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:44:33,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2023-12-02 17:44:36,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:44:36,438 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:44:36,438 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2023-12-02 17:44:36,456 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/data/58045981f/41feab6d4bec4789ae4032ccbc37a79c/FLAGa37b594b5 [2023-12-02 17:44:36,471 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/data/58045981f/41feab6d4bec4789ae4032ccbc37a79c [2023-12-02 17:44:36,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:44:36,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:44:36,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:44:36,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:44:36,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:44:36,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:44:36" (1/1) ... [2023-12-02 17:44:36,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@141a96e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:36, skipping insertion in model container [2023-12-02 17:44:36,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:44:36" (1/1) ... [2023-12-02 17:44:36,547 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:44:37,001 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:44:37,014 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 17:44:37,037 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:44:37,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:44:37,147 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:44:37,212 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:44:37,246 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:44:37,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:37 WrapperNode [2023-12-02 17:44:37,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:44:37,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:44:37,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:44:37,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:44:37,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:37" (1/1) ... [2023-12-02 17:44:37,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:37" (1/1) ... [2023-12-02 17:44:37,339 INFO L138 Inliner]: procedures = 180, calls = 340, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1135 [2023-12-02 17:44:37,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:44:37,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:44:37,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:44:37,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:44:37,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:37" (1/1) ... [2023-12-02 17:44:37,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:37" (1/1) ... [2023-12-02 17:44:37,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:37" (1/1) ... [2023-12-02 17:44:37,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:37" (1/1) ... [2023-12-02 17:44:37,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:37" (1/1) ... [2023-12-02 17:44:37,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:37" (1/1) ... [2023-12-02 17:44:37,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:37" (1/1) ... [2023-12-02 17:44:37,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:37" (1/1) ... [2023-12-02 17:44:37,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:44:37,465 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:44:37,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:44:37,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:44:37,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:37" (1/1) ... [2023-12-02 17:44:37,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:44:37,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:44:37,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:44:37,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:44:37,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 17:44:37,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 17:44:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 17:44:37,526 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 17:44:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 17:44:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:44:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 17:44:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 17:44:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 17:44:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:44:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 17:44:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 17:44:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:44:37,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:44:37,740 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:44:37,743 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:44:37,747 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 17:44:42,735 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:44:42,958 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:44:42,958 INFO L309 CfgBuilder]: Removed 60 assume(true) statements. [2023-12-02 17:44:42,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:44:42 BoogieIcfgContainer [2023-12-02 17:44:42,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:44:42,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:44:42,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:44:42,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:44:42,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:44:36" (1/3) ... [2023-12-02 17:44:42,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9cbe3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:44:42, skipping insertion in model container [2023-12-02 17:44:42,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:44:37" (2/3) ... [2023-12-02 17:44:42,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9cbe3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:44:42, skipping insertion in model container [2023-12-02 17:44:42,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:44:42" (3/3) ... [2023-12-02 17:44:42,969 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-1.i [2023-12-02 17:44:42,988 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:44:42,988 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 648 error locations. [2023-12-02 17:44:43,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:44:43,062 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;@821e1d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:44:43,062 INFO L358 AbstractCegarLoop]: Starting to check reachability of 648 error locations. [2023-12-02 17:44:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 1137 states, 487 states have (on average 2.564681724845996) internal successors, (1249), 1129 states have internal predecessors, (1249), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:44:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-12-02 17:44:43,075 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:44:43,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-12-02 17:44:43,076 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr647ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:44:43,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:44:43,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1818566, now seen corresponding path program 1 times [2023-12-02 17:44:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:44:43,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409584224] [2023-12-02 17:44:43,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:43,094 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 17:44:43,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:44:43,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:43,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:43,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 17:44:43,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:43,287 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 17:44:43,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:44:43,288 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:44:43,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409584224] [2023-12-02 17:44:43,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409584224] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:44:43,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:44:43,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 17:44:43,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976595378] [2023-12-02 17:44:43,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:44:43,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:44:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:44:43,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:44:43,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:44:43,324 INFO L87 Difference]: Start difference. First operand has 1137 states, 487 states have (on average 2.564681724845996) internal successors, (1249), 1129 states have internal predecessors, (1249), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:44:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:44:45,529 INFO L93 Difference]: Finished difference Result 1139 states and 1197 transitions. [2023-12-02 17:44:45,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:44:45,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-12-02 17:44:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:44:45,553 INFO L225 Difference]: With dead ends: 1139 [2023-12-02 17:44:45,553 INFO L226 Difference]: Without dead ends: 1136 [2023-12-02 17:44:45,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:44:45,558 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 24 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:44:45,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1575 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-02 17:44:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2023-12-02 17:44:45,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1127. [2023-12-02 17:44:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 488 states have (on average 2.4139344262295084) internal successors, (1178), 1119 states have internal predecessors, (1178), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:44:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1190 transitions. [2023-12-02 17:44:45,649 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1190 transitions. Word has length 3 [2023-12-02 17:44:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:44:45,650 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 1190 transitions. [2023-12-02 17:44:45,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:44:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1190 transitions. [2023-12-02 17:44:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 17:44:45,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:44:45,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 17:44:45,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:45,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:45,853 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:44:45,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:44:45,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1745955341, now seen corresponding path program 1 times [2023-12-02 17:44:45,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:44:45,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60873682] [2023-12-02 17:44:45,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:45,855 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 17:44:45,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:44:45,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:45,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:46,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 17:44:46,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:46,058 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 17:44:46,067 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 17:44:46,068 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:44:46,068 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:44:46,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60873682] [2023-12-02 17:44:46,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60873682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:44:46,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:44:46,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:44:46,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397048257] [2023-12-02 17:44:46,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:44:46,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:44:46,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:44:46,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:44:46,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:44:46,071 INFO L87 Difference]: Start difference. First operand 1127 states and 1190 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:44:48,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:44:48,319 INFO L93 Difference]: Finished difference Result 1157 states and 1231 transitions. [2023-12-02 17:44:48,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:44:48,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 17:44:48,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:44:48,326 INFO L225 Difference]: With dead ends: 1157 [2023-12-02 17:44:48,326 INFO L226 Difference]: Without dead ends: 1157 [2023-12-02 17:44:48,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:44:48,328 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 1029 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:44:48,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 533 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-02 17:44:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2023-12-02 17:44:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1100. [2023-12-02 17:44:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 554 states have (on average 2.1805054151624548) internal successors, (1208), 1092 states have internal predecessors, (1208), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:44:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1220 transitions. [2023-12-02 17:44:48,359 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1220 transitions. Word has length 5 [2023-12-02 17:44:48,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:44:48,359 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1220 transitions. [2023-12-02 17:44:48,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:44:48,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1220 transitions. [2023-12-02 17:44:48,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 17:44:48,360 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:44:48,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 17:44:48,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:48,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:48,561 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:44:48,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:44:48,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1745955342, now seen corresponding path program 1 times [2023-12-02 17:44:48,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:44:48,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298793649] [2023-12-02 17:44:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:48,563 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 17:44:48,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:44:48,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:48,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:48,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:44:48,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:48,656 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 17:44:48,675 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 17:44:48,675 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:44:48,675 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:44:48,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298793649] [2023-12-02 17:44:48,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298793649] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:44:48,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:44:48,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:44:48,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903852668] [2023-12-02 17:44:48,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:44:48,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:44:48,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:44:48,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:44:48,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:44:48,678 INFO L87 Difference]: Start difference. First operand 1100 states and 1220 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:44:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:44:52,117 INFO L93 Difference]: Finished difference Result 1372 states and 1512 transitions. [2023-12-02 17:44:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:44:52,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 17:44:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:44:52,122 INFO L225 Difference]: With dead ends: 1372 [2023-12-02 17:44:52,123 INFO L226 Difference]: Without dead ends: 1372 [2023-12-02 17:44:52,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:44:52,124 INFO L413 NwaCegarLoop]: 771 mSDtfsCounter, 456 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:44:52,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1123 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-02 17:44:52,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2023-12-02 17:44:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1223. [2023-12-02 17:44:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 687 states have (on average 2.155749636098981) internal successors, (1481), 1215 states have internal predecessors, (1481), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 17:44:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1493 transitions. [2023-12-02 17:44:52,158 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1493 transitions. Word has length 5 [2023-12-02 17:44:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:44:52,159 INFO L495 AbstractCegarLoop]: Abstraction has 1223 states and 1493 transitions. [2023-12-02 17:44:52,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:44:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1493 transitions. [2023-12-02 17:44:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 17:44:52,159 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:44:52,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 17:44:52,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 17:44:52,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:52,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:44:52,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:44:52,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1708268006, now seen corresponding path program 1 times [2023-12-02 17:44:52,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:44:52,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424266784] [2023-12-02 17:44:52,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:52,361 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 17:44:52,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:44:52,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:52,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:52,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 17:44:52,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:52,498 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 17:44:52,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:44:52,499 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:44:52,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424266784] [2023-12-02 17:44:52,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424266784] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:44:52,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:44:52,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:44:52,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223441971] [2023-12-02 17:44:52,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:44:52,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:44:52,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:44:52,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:44:52,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:44:52,502 INFO L87 Difference]: Start difference. First operand 1223 states and 1493 transitions. Second operand has 4 states, 4 states have (on average 1.5) 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 17:44:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:44:55,293 INFO L93 Difference]: Finished difference Result 1979 states and 2434 transitions. [2023-12-02 17:44:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:44:55,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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 17:44:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:44:55,303 INFO L225 Difference]: With dead ends: 1979 [2023-12-02 17:44:55,303 INFO L226 Difference]: Without dead ends: 1977 [2023-12-02 17:44:55,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 17:44:55,305 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 699 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:44:55,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 2558 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-02 17:44:55,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2023-12-02 17:44:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1667. [2023-12-02 17:44:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1131 states have (on average 2.1343943412908932) internal successors, (2414), 1656 states have internal predecessors, (2414), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 17:44:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2432 transitions. [2023-12-02 17:44:55,347 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2432 transitions. Word has length 6 [2023-12-02 17:44:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:44:55,347 INFO L495 AbstractCegarLoop]: Abstraction has 1667 states and 2432 transitions. [2023-12-02 17:44:55,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) 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 17:44:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2432 transitions. [2023-12-02 17:44:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 17:44:55,348 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:44:55,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:44:55,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:55,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:55,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:44:55,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:44:55,550 INFO L85 PathProgramCache]: Analyzing trace with hash -735995369, now seen corresponding path program 1 times [2023-12-02 17:44:55,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:44:55,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738556294] [2023-12-02 17:44:55,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:55,551 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 17:44:55,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:44:55,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:55,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:55,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 17:44:55,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:55,732 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 17:44:55,732 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:44:55,733 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:44:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738556294] [2023-12-02 17:44:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738556294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:44:55,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:44:55,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:44:55,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229615150] [2023-12-02 17:44:55,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:44:55,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:44:55,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:44:55,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:44:55,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:44:55,735 INFO L87 Difference]: Start difference. First operand 1667 states and 2432 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:44:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:44:56,915 INFO L93 Difference]: Finished difference Result 1613 states and 2352 transitions. [2023-12-02 17:44:56,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:44:56,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-02 17:44:56,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:44:56,930 INFO L225 Difference]: With dead ends: 1613 [2023-12-02 17:44:56,930 INFO L226 Difference]: Without dead ends: 1613 [2023-12-02 17:44:56,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:44:56,931 INFO L413 NwaCegarLoop]: 895 mSDtfsCounter, 70 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:44:56,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1741 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 17:44:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2023-12-02 17:44:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1613. [2023-12-02 17:44:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1101 states have (on average 2.119891008174387) internal successors, (2334), 1602 states have internal predecessors, (2334), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 17:44:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2352 transitions. [2023-12-02 17:44:56,979 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2352 transitions. Word has length 11 [2023-12-02 17:44:56,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:44:56,980 INFO L495 AbstractCegarLoop]: Abstraction has 1613 states and 2352 transitions. [2023-12-02 17:44:56,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:44:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2352 transitions. [2023-12-02 17:44:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 17:44:56,981 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:44:56,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:44:56,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:57,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:57,185 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:44:57,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:44:57,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1378050225, now seen corresponding path program 1 times [2023-12-02 17:44:57,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:44:57,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128474601] [2023-12-02 17:44:57,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:57,187 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 17:44:57,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:44:57,189 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:57,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:57,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 17:44:57,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:57,365 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 17:44:57,365 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:44:57,365 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:44:57,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128474601] [2023-12-02 17:44:57,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128474601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:44:57,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:44:57,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:44:57,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911715645] [2023-12-02 17:44:57,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:44:57,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:44:57,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:44:57,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:44:57,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:44:57,368 INFO L87 Difference]: Start difference. First operand 1613 states and 2352 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 17:44:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:44:59,182 INFO L93 Difference]: Finished difference Result 1599 states and 2310 transitions. [2023-12-02 17:44:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:44:59,184 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 17:44:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:44:59,195 INFO L225 Difference]: With dead ends: 1599 [2023-12-02 17:44:59,196 INFO L226 Difference]: Without dead ends: 1599 [2023-12-02 17:44:59,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:44:59,197 INFO L413 NwaCegarLoop]: 864 mSDtfsCounter, 58 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 17:44:59,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2568 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 17:44:59,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2023-12-02 17:44:59,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1597. [2023-12-02 17:44:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1099 states have (on average 2.083712465878071) internal successors, (2290), 1586 states have internal predecessors, (2290), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 17:44:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2308 transitions. [2023-12-02 17:44:59,255 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2308 transitions. Word has length 13 [2023-12-02 17:44:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:44:59,256 INFO L495 AbstractCegarLoop]: Abstraction has 1597 states and 2308 transitions. [2023-12-02 17:44:59,256 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 17:44:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2308 transitions. [2023-12-02 17:44:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 17:44:59,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:44:59,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:44:59,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:59,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:59,460 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:44:59,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:44:59,461 INFO L85 PathProgramCache]: Analyzing trace with hash 291695839, now seen corresponding path program 1 times [2023-12-02 17:44:59,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:44:59,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531463405] [2023-12-02 17:44:59,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:59,462 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 17:44:59,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:44:59,463 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:59,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:44:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:59,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:44:59,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:59,664 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 17:44:59,751 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 17:44:59,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:44:59,751 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:44:59,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531463405] [2023-12-02 17:44:59,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531463405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:44:59,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:44:59,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:44:59,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731148055] [2023-12-02 17:44:59,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:44:59,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:44:59,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:44:59,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:44:59,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:44:59,754 INFO L87 Difference]: Start difference. First operand 1597 states and 2308 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:45:03,208 INFO L93 Difference]: Finished difference Result 1650 states and 2311 transitions. [2023-12-02 17:45:03,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:45:03,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-02 17:45:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:45:03,217 INFO L225 Difference]: With dead ends: 1650 [2023-12-02 17:45:03,217 INFO L226 Difference]: Without dead ends: 1650 [2023-12-02 17:45:03,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:45:03,218 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 964 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:45:03,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 853 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-02 17:45:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2023-12-02 17:45:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1593. [2023-12-02 17:45:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1099 states have (on average 2.0764331210191083) internal successors, (2282), 1582 states have internal predecessors, (2282), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 17:45:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2300 transitions. [2023-12-02 17:45:03,264 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2300 transitions. Word has length 27 [2023-12-02 17:45:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:45:03,265 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 2300 transitions. [2023-12-02 17:45:03,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2300 transitions. [2023-12-02 17:45:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 17:45:03,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:45:03,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:45:03,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:03,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:03,467 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:45:03,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:45:03,468 INFO L85 PathProgramCache]: Analyzing trace with hash 291695840, now seen corresponding path program 1 times [2023-12-02 17:45:03,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:45:03,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551134010] [2023-12-02 17:45:03,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:03,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:45:03,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:45:03,470 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:03,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:03,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 17:45:03,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:03,630 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 17:45:03,817 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 17:45:03,817 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:45:03,817 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:45:03,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551134010] [2023-12-02 17:45:03,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551134010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:45:03,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:45:03,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:45:03,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296288782] [2023-12-02 17:45:03,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:45:03,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:45:03,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:45:03,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:45:03,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:45:03,819 INFO L87 Difference]: Start difference. First operand 1593 states and 2300 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:45:08,572 INFO L93 Difference]: Finished difference Result 1739 states and 2312 transitions. [2023-12-02 17:45:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:45:08,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-02 17:45:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:45:08,581 INFO L225 Difference]: With dead ends: 1739 [2023-12-02 17:45:08,581 INFO L226 Difference]: Without dead ends: 1739 [2023-12-02 17:45:08,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:45:08,582 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 393 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:45:08,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1563 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-02 17:45:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2023-12-02 17:45:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1589. [2023-12-02 17:45:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1099 states have (on average 2.0691537761601455) internal successors, (2274), 1578 states have internal predecessors, (2274), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 17:45:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2292 transitions. [2023-12-02 17:45:08,616 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2292 transitions. Word has length 27 [2023-12-02 17:45:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:45:08,616 INFO L495 AbstractCegarLoop]: Abstraction has 1589 states and 2292 transitions. [2023-12-02 17:45:08,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2292 transitions. [2023-12-02 17:45:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 17:45:08,618 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:45:08,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:45:08,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Forceful destruction successful, exit code 0 [2023-12-02 17:45:08,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:08,819 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:45:08,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:45:08,820 INFO L85 PathProgramCache]: Analyzing trace with hash 70830169, now seen corresponding path program 1 times [2023-12-02 17:45:08,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:45:08,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173168561] [2023-12-02 17:45:08,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:08,821 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 17:45:08,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:45:08,823 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:08,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:09,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 17:45:09,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:09,093 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 17:45:09,093 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:45:09,094 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:45:09,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173168561] [2023-12-02 17:45:09,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173168561] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:45:09,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:45:09,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:45:09,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606178590] [2023-12-02 17:45:09,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:45:09,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:45:09,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:45:09,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:45:09,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:45:09,096 INFO L87 Difference]: Start difference. First operand 1589 states and 2292 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:45:10,496 INFO L93 Difference]: Finished difference Result 1577 states and 2272 transitions. [2023-12-02 17:45:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:45:10,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-12-02 17:45:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:45:10,504 INFO L225 Difference]: With dead ends: 1577 [2023-12-02 17:45:10,504 INFO L226 Difference]: Without dead ends: 1577 [2023-12-02 17:45:10,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:45:10,505 INFO L413 NwaCegarLoop]: 858 mSDtfsCounter, 23 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:45:10,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2554 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 17:45:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2023-12-02 17:45:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1577. [2023-12-02 17:45:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1087 states have (on average 2.0735970561177552) internal successors, (2254), 1566 states have internal predecessors, (2254), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 17:45:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2272 transitions. [2023-12-02 17:45:10,541 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2272 transitions. Word has length 43 [2023-12-02 17:45:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:45:10,541 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 2272 transitions. [2023-12-02 17:45:10,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2272 transitions. [2023-12-02 17:45:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 17:45:10,543 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:45:10,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:45:10,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:10,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:10,744 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:45:10,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:45:10,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1391729543, now seen corresponding path program 1 times [2023-12-02 17:45:10,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:45:10,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290840264] [2023-12-02 17:45:10,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:10,745 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 17:45:10,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:45:10,746 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:10,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:10,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 17:45:10,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:11,238 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 17:45:11,238 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:45:11,238 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:45:11,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290840264] [2023-12-02 17:45:11,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290840264] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:45:11,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:45:11,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:45:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262647711] [2023-12-02 17:45:11,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:45:11,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:45:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:45:11,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:45:11,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:45:11,240 INFO L87 Difference]: Start difference. First operand 1577 states and 2272 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:45:12,313 INFO L93 Difference]: Finished difference Result 1469 states and 2048 transitions. [2023-12-02 17:45:12,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:45:12,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-12-02 17:45:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:45:12,324 INFO L225 Difference]: With dead ends: 1469 [2023-12-02 17:45:12,325 INFO L226 Difference]: Without dead ends: 1469 [2023-12-02 17:45:12,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:45:12,326 INFO L413 NwaCegarLoop]: 873 mSDtfsCounter, 59 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:45:12,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1667 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 17:45:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2023-12-02 17:45:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2023-12-02 17:45:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 979 states have (on average 2.073544433094995) internal successors, (2030), 1458 states have internal predecessors, (2030), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 17:45:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2048 transitions. [2023-12-02 17:45:12,368 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2048 transitions. Word has length 47 [2023-12-02 17:45:12,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:45:12,369 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 2048 transitions. [2023-12-02 17:45:12,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2048 transitions. [2023-12-02 17:45:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 17:45:12,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:45:12,371 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 17:45:12,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:12,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:12,574 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:45:12,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:45:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1802984030, now seen corresponding path program 1 times [2023-12-02 17:45:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:45:12,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479316957] [2023-12-02 17:45:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:12,576 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 17:45:12,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:45:12,577 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:12,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:12,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:45:12,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:12,977 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 17:45:12,986 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 17:45:13,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:45:13,590 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 17:45:13,611 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:45:13,612 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 17:45:13,637 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 17:45:13,638 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:45:13,638 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:45:13,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479316957] [2023-12-02 17:45:13,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479316957] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:45:13,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:45:13,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:45:13,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128686776] [2023-12-02 17:45:13,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:45:13,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:45:13,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:45:13,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:45:13,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:45:13,641 INFO L87 Difference]: Start difference. First operand 1469 states and 2048 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:17,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:45:17,029 INFO L93 Difference]: Finished difference Result 1441 states and 1932 transitions. [2023-12-02 17:45:17,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:45:17,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-02 17:45:17,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:45:17,036 INFO L225 Difference]: With dead ends: 1441 [2023-12-02 17:45:17,036 INFO L226 Difference]: Without dead ends: 1441 [2023-12-02 17:45:17,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:45:17,037 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 943 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:45:17,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 290 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-02 17:45:17,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2023-12-02 17:45:17,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1252. [2023-12-02 17:45:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 846 states have (on average 1.9148936170212767) internal successors, (1620), 1241 states have internal predecessors, (1620), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 17:45:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1638 transitions. [2023-12-02 17:45:17,070 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1638 transitions. Word has length 50 [2023-12-02 17:45:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:45:17,071 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1638 transitions. [2023-12-02 17:45:17,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1638 transitions. [2023-12-02 17:45:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 17:45:17,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:45:17,073 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 17:45:17,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:17,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:17,276 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:45:17,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:45:17,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2028466261, now seen corresponding path program 1 times [2023-12-02 17:45:17,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:45:17,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321319907] [2023-12-02 17:45:17,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:17,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:45:17,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:45:17,279 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:17,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:17,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 17:45:17,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:17,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 17:45:17,661 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 17:45:17,688 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 17:45:17,701 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 17:45:17,702 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:45:17,702 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:45:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321319907] [2023-12-02 17:45:17,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321319907] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:45:17,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:45:17,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:45:17,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747811612] [2023-12-02 17:45:17,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:45:17,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:45:17,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:45:17,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:45:17,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:45:17,705 INFO L87 Difference]: Start difference. First operand 1252 states and 1638 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:45:21,678 INFO L93 Difference]: Finished difference Result 1251 states and 1636 transitions. [2023-12-02 17:45:21,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:45:21,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-02 17:45:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:45:21,689 INFO L225 Difference]: With dead ends: 1251 [2023-12-02 17:45:21,689 INFO L226 Difference]: Without dead ends: 1251 [2023-12-02 17:45:21,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:45:21,690 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 3 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:45:21,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1963 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-02 17:45:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2023-12-02 17:45:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2023-12-02 17:45:21,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 846 states have (on average 1.9125295508274232) internal successors, (1618), 1240 states have internal predecessors, (1618), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 17:45:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1636 transitions. [2023-12-02 17:45:21,720 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1636 transitions. Word has length 54 [2023-12-02 17:45:21,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:45:21,721 INFO L495 AbstractCegarLoop]: Abstraction has 1251 states and 1636 transitions. [2023-12-02 17:45:21,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1636 transitions. [2023-12-02 17:45:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 17:45:21,723 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:45:21,723 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 17:45:21,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:21,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:21,928 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:45:21,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:45:21,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2028466260, now seen corresponding path program 1 times [2023-12-02 17:45:21,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:45:21,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167527792] [2023-12-02 17:45:21,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:21,929 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 17:45:21,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:45:21,930 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:21,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:22,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 17:45:22,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:22,253 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 17:45:22,277 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 17:45:22,288 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 17:45:22,342 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 17:45:22,369 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 17:45:22,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:45:22,369 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:45:22,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167527792] [2023-12-02 17:45:22,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167527792] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:45:22,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:45:22,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:45:22,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841421736] [2023-12-02 17:45:22,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:45:22,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:45:22,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:45:22,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:45:22,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:45:22,371 INFO L87 Difference]: Start difference. First operand 1251 states and 1636 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:45:27,433 INFO L93 Difference]: Finished difference Result 1250 states and 1634 transitions. [2023-12-02 17:45:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:45:27,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-02 17:45:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:45:27,440 INFO L225 Difference]: With dead ends: 1250 [2023-12-02 17:45:27,440 INFO L226 Difference]: Without dead ends: 1250 [2023-12-02 17:45:27,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:45:27,441 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 1 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:45:27,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1986 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-12-02 17:45:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2023-12-02 17:45:27,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2023-12-02 17:45:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 844 states have (on average 1.914691943127962) internal successors, (1616), 1239 states have internal predecessors, (1616), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 17:45:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1634 transitions. [2023-12-02 17:45:27,458 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1634 transitions. Word has length 54 [2023-12-02 17:45:27,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:45:27,458 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1634 transitions. [2023-12-02 17:45:27,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:45:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1634 transitions. [2023-12-02 17:45:27,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 17:45:27,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:45:27,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:45:27,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:27,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:27,665 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:45:27,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:45:27,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1249065009, now seen corresponding path program 1 times [2023-12-02 17:45:27,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:45:27,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298695768] [2023-12-02 17:45:27,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:27,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:45:27,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:45:27,667 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:27,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:27,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 17:45:27,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:27,960 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 17:45:27,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:45:27,960 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:45:27,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298695768] [2023-12-02 17:45:27,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298695768] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:45:27,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:45:27,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:45:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510761524] [2023-12-02 17:45:27,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:45:27,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:45:27,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:45:27,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:45:27,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:45:27,963 INFO L87 Difference]: Start difference. First operand 1250 states and 1634 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:45:29,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:45:29,425 INFO L93 Difference]: Finished difference Result 1252 states and 1639 transitions. [2023-12-02 17:45:29,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:45:29,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2023-12-02 17:45:29,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:45:29,434 INFO L225 Difference]: With dead ends: 1252 [2023-12-02 17:45:29,434 INFO L226 Difference]: Without dead ends: 1252 [2023-12-02 17:45:29,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:45:29,435 INFO L413 NwaCegarLoop]: 785 mSDtfsCounter, 1 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:45:29,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2349 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 17:45:29,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2023-12-02 17:45:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2023-12-02 17:45:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 845 states have (on average 1.9147928994082841) internal successors, (1618), 1241 states have internal predecessors, (1618), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-02 17:45:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1639 transitions. [2023-12-02 17:45:29,465 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1639 transitions. Word has length 60 [2023-12-02 17:45:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:45:29,465 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1639 transitions. [2023-12-02 17:45:29,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:45:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1639 transitions. [2023-12-02 17:45:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 17:45:29,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:45:29,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:29,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Forceful destruction successful, exit code 0 [2023-12-02 17:45:29,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:29,673 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:45:29,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:45:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1386880438, now seen corresponding path program 1 times [2023-12-02 17:45:29,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:45:29,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861624981] [2023-12-02 17:45:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:29,674 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 17:45:29,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:45:29,675 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:29,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:29,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:45:29,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:29,963 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 17:45:29,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:45:30,036 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 17:45:30,037 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:45:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861624981] [2023-12-02 17:45:30,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861624981] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:45:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [991246910] [2023-12-02 17:45:30,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:30,037 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:45:30,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:45:30,039 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:45:30,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-02 17:45:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:30,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:45:30,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:30,518 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 17:45:30,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:45:30,547 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 17:45:30,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [991246910] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:45:30,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222003713] [2023-12-02 17:45:30,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:30,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:45:30,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:45:30,549 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:45:30,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 17:45:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:45:30,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:45:30,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:30,834 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 17:45:30,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:45:30,865 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 17:45:30,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222003713] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:45:30,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 17:45:30,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 17:45:30,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093784384] [2023-12-02 17:45:30,866 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 17:45:30,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 17:45:30,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:45:30,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 17:45:30,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 17:45:30,868 INFO L87 Difference]: Start difference. First operand 1252 states and 1639 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 17:45:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:45:33,704 INFO L93 Difference]: Finished difference Result 1261 states and 1655 transitions. [2023-12-02 17:45:33,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 17:45:33,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2023-12-02 17:45:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:45:33,711 INFO L225 Difference]: With dead ends: 1261 [2023-12-02 17:45:33,711 INFO L226 Difference]: Without dead ends: 1261 [2023-12-02 17:45:33,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-12-02 17:45:33,712 INFO L413 NwaCegarLoop]: 783 mSDtfsCounter, 6 mSDsluCounter, 4674 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5457 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:45:33,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5457 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-02 17:45:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2023-12-02 17:45:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1260. [2023-12-02 17:45:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 852 states have (on average 1.914319248826291) internal successors, (1631), 1248 states have internal predecessors, (1631), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-02 17:45:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1652 transitions. [2023-12-02 17:45:33,734 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1652 transitions. Word has length 61 [2023-12-02 17:45:33,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:45:33,734 INFO L495 AbstractCegarLoop]: Abstraction has 1260 states and 1652 transitions. [2023-12-02 17:45:33,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 17:45:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1652 transitions. [2023-12-02 17:45:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 17:45:33,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:45:33,735 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:45:33,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-02 17:45:33,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 17:45:34,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-12-02 17:45:34,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 17:45:34,336 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:45:34,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:45:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1121547889, now seen corresponding path program 2 times [2023-12-02 17:45:34,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:45:34,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121154281] [2023-12-02 17:45:34,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:45:34,337 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 17:45:34,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:45:34,338 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:34,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:45:34,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 17:45:34,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:45:34,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 17:45:34,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:34,824 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 17:45:34,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:45:34,993 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 17:45:34,993 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:45:34,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121154281] [2023-12-02 17:45:34,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121154281] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:45:34,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [31153960] [2023-12-02 17:45:34,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:45:34,994 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:45:34,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:45:34,995 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:45:34,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-02 17:45:36,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 17:45:36,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:45:36,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 17:45:36,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:36,290 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 17:45:36,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:45:36,358 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 17:45:36,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [31153960] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:45:36,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352220959] [2023-12-02 17:45:36,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:45:36,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:45:36,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:45:36,360 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:45:36,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 17:45:49,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 17:45:49,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:45:49,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 17:45:49,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:45:49,559 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:45:49,560 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 17:45:49,591 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 17:45:49,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:45:49,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:45:49,953 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 17:45:49,988 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 17:45:49,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:45:50,108 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 17:45:50,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-12-02 17:45:50,118 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1258) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2023-12-02 17:45:50,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352220959] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:45:50,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 17:45:50,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2023-12-02 17:45:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286185602] [2023-12-02 17:45:50,122 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 17:45:50,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 17:45:50,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:45:50,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 17:45:50,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2023-12-02 17:45:50,124 INFO L87 Difference]: Start difference. First operand 1260 states and 1652 transitions. Second operand has 24 states, 21 states have (on average 5.714285714285714) internal successors, (120), 23 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 17:46:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:46:02,144 INFO L93 Difference]: Finished difference Result 1330 states and 1691 transitions. [2023-12-02 17:46:02,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 17:46:02,146 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.714285714285714) internal successors, (120), 23 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2023-12-02 17:46:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:46:02,155 INFO L225 Difference]: With dead ends: 1330 [2023-12-02 17:46:02,155 INFO L226 Difference]: Without dead ends: 1328 [2023-12-02 17:46:02,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=455, Invalid=2410, Unknown=1, NotChecked=104, Total=2970 [2023-12-02 17:46:02,158 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 865 mSDsluCounter, 4682 mSDsCounter, 0 mSdLazyCounter, 7106 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 5074 SdHoareTripleChecker+Invalid, 7160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 7106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:46:02,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 5074 Invalid, 7160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 7106 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2023-12-02 17:46:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2023-12-02 17:46:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1268. [2023-12-02 17:46:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 861 states have (on average 1.9059233449477353) internal successors, (1641), 1256 states have internal predecessors, (1641), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-02 17:46:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1662 transitions. [2023-12-02 17:46:02,196 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1662 transitions. Word has length 64 [2023-12-02 17:46:02,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:46:02,196 INFO L495 AbstractCegarLoop]: Abstraction has 1268 states and 1662 transitions. [2023-12-02 17:46:02,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.714285714285714) internal successors, (120), 23 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 17:46:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1662 transitions. [2023-12-02 17:46:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 17:46:02,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:46:02,197 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:46:02,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-12-02 17:46:02,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-02 17:46:02,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 17:46:02,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:46:02,799 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:46:02,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:46:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1368999982, now seen corresponding path program 1 times [2023-12-02 17:46:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:46:02,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304515264] [2023-12-02 17:46:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:46:02,800 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 17:46:02,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:46:02,802 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:46:02,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:46:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:46:03,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 17:46:03,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:46:03,335 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 17:46:03,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:46:03,894 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 17:46:03,894 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:46:03,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304515264] [2023-12-02 17:46:03,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304515264] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:46:03,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [768039126] [2023-12-02 17:46:03,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:46:03,895 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:46:03,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:46:03,896 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:46:03,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-02 17:46:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:46:04,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 17:46:04,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:46:04,581 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 17:46:04,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:46:04,723 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 17:46:04,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [768039126] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:46:04,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451180117] [2023-12-02 17:46:04,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:46:04,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:46:04,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:46:04,724 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:46:04,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 17:46:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:46:05,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 17:46:05,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:46:05,184 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 17:46:05,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:46:06,104 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 17:46:06,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451180117] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:46:06,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 17:46:06,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 17:46:06,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527482017] [2023-12-02 17:46:06,105 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 17:46:06,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 17:46:06,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:46:06,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 17:46:06,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 17:46:06,108 INFO L87 Difference]: Start difference. First operand 1268 states and 1662 transitions. Second operand has 38 states, 35 states have (on average 2.657142857142857) internal successors, (93), 38 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 17:46:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:46:14,981 INFO L93 Difference]: Finished difference Result 1298 states and 1725 transitions. [2023-12-02 17:46:14,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 17:46:14,983 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.657142857142857) internal successors, (93), 38 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2023-12-02 17:46:14,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:46:14,991 INFO L225 Difference]: With dead ends: 1298 [2023-12-02 17:46:14,991 INFO L226 Difference]: Without dead ends: 1295 [2023-12-02 17:46:14,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 17:46:14,995 INFO L413 NwaCegarLoop]: 780 mSDtfsCounter, 24 mSDsluCounter, 10106 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10886 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:46:14,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10886 Invalid, 2549 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [49 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-12-02 17:46:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2023-12-02 17:46:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1286. [2023-12-02 17:46:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 879 states have (on average 1.8930602957906713) internal successors, (1664), 1274 states have internal predecessors, (1664), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-02 17:46:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1685 transitions. [2023-12-02 17:46:15,025 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1685 transitions. Word has length 70 [2023-12-02 17:46:15,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:46:15,025 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 1685 transitions. [2023-12-02 17:46:15,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.657142857142857) internal successors, (93), 38 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 17:46:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1685 transitions. [2023-12-02 17:46:15,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-02 17:46:15,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:46:15,026 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:46:15,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 17:46:15,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-12-02 17:46:15,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:46:15,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:46:15,628 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:46:15,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:46:15,628 INFO L85 PathProgramCache]: Analyzing trace with hash -43277678, now seen corresponding path program 2 times [2023-12-02 17:46:15,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:46:15,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110198870] [2023-12-02 17:46:15,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:46:15,629 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 17:46:15,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:46:15,630 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:46:15,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:46:16,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 17:46:16,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:46:16,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 17:46:16,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:46:16,879 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 17:46:16,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:46:19,607 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 17:46:19,607 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:46:19,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110198870] [2023-12-02 17:46:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110198870] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:46:19,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1968122424] [2023-12-02 17:46:19,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:46:19,608 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:46:19,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:46:19,609 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:46:19,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-12-02 17:46:20,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 17:46:20,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:46:20,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 17:46:20,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:46:21,112 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 17:46:21,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:46:21,721 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 17:46:21,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1968122424] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:46:21,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820121950] [2023-12-02 17:46:21,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:46:21,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:46:21,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:46:21,723 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:46:21,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 17:46:35,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 17:46:35,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:46:35,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 17:46:35,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:46:35,831 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:46:35,831 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 17:46:35,837 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 17:46:35,967 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 17:46:35,982 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 17:46:36,382 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 17:46:36,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 17:46:37,154 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:46:37,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:46: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 30 treesize of output 13 [2023-12-02 17:46:37,382 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 17:46:37,392 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 17:46:37,495 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 17:46:37,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:46:38,582 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2458) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 17:46:38,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820121950] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:46:38,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 17:46:38,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2023-12-02 17:46:38,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923322367] [2023-12-02 17:46:38,590 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 17:46:38,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-02 17:46:38,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:46:38,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-02 17:46:38,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2023-12-02 17:46:38,592 INFO L87 Difference]: Start difference. First operand 1286 states and 1685 transitions. Second operand has 58 states, 55 states have (on average 2.8363636363636364) internal successors, (156), 58 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 17:47:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:40,690 INFO L93 Difference]: Finished difference Result 1455 states and 1936 transitions. [2023-12-02 17:47:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2023-12-02 17:47:40,692 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 2.8363636363636364) internal successors, (156), 58 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 82 [2023-12-02 17:47:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:40,697 INFO L225 Difference]: With dead ends: 1455 [2023-12-02 17:47:40,697 INFO L226 Difference]: Without dead ends: 1446 [2023-12-02 17:47:40,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7047 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=5889, Invalid=20846, Unknown=1, NotChecked=324, Total=27060 [2023-12-02 17:47:40,706 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 906 mSDsluCounter, 10503 mSDsCounter, 0 mSdLazyCounter, 20255 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 10895 SdHoareTripleChecker+Invalid, 20396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 20255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:40,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 10895 Invalid, 20396 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [141 Valid, 20255 Invalid, 0 Unknown, 0 Unchecked, 43.2s Time] [2023-12-02 17:47:40,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2023-12-02 17:47:40,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1370. [2023-12-02 17:47:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 963 states have (on average 1.8276220145379023) internal successors, (1760), 1357 states have internal predecessors, (1760), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-02 17:47:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1781 transitions. [2023-12-02 17:47:40,751 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1781 transitions. Word has length 82 [2023-12-02 17:47:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:40,751 INFO L495 AbstractCegarLoop]: Abstraction has 1370 states and 1781 transitions. [2023-12-02 17:47:40,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 2.8363636363636364) internal successors, (156), 58 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 17:47:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1781 transitions. [2023-12-02 17:47:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-02 17:47:40,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:40,753 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:40,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Forceful destruction successful, exit code 0 [2023-12-02 17:47:40,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 17:47:41,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-12-02 17:47:41,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 17:47:41,354 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:47:41,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash 773579426, now seen corresponding path program 1 times [2023-12-02 17:47:41,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:47:41,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521721412] [2023-12-02 17:47:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:41,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:47:41,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:47:41,358 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:47:41,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:47:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:42,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 17:47:42,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:47:42,287 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 17:47:42,386 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 17:47:42,386 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 17:47:42,427 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 17:47:42,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 17:47:43,618 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:47:43,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:47:43,732 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:47:43,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:47:43,747 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 17:47:43,788 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 17:47:43,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:47:45,919 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2865 (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_2865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 17:47:46,379 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2911))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2865)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 17:47:46,382 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:47:46,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521721412] [2023-12-02 17:47:46,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521721412] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:47:46,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [292380410] [2023-12-02 17:47:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:46,382 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:47:46,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:47:46,383 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:47:46,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-02 17:47:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:48,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 17:47:48,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:47:48,847 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 17:47:48,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 17:47:49,366 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 17:47:49,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 17:47:49,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:47:49,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-02 17:47:51,437 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:47:51,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 17:47:51,674 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:47:51,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 17:47:51,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-02 17:47:51,784 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 17:47:51,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:47:51,801 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3318) |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 17:47:51,813 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3318 (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_3318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 17:47:52,275 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3364))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3318)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 17:47:52,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [292380410] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:47:52,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058836831] [2023-12-02 17:47:52,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:52,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:47:52,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:47:52,279 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:47:52,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 17:47:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:52,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 17:47:52,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:47:52,975 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:47:52,975 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 17:47:53,025 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 17:47:53,834 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:47:53,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:47:54,041 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:47:54,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:47:54,056 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 17:47:54,061 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 17:47:54,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:47:54,081 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3769 (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~mem35#1.base| v_ArrVal_3769) |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 17:47:54,095 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3769 (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_3769) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 17:47:54,655 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 17:47:54,655 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 17:47:54,666 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3769 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3815))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3769)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-12-02 17:47:54,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058836831] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:47:54,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:47:54,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2023-12-02 17:47:54,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567580738] [2023-12-02 17:47:54,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:47:54,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 17:47:54,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:47:54,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 17:47:54,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=742, Unknown=11, NotChecked=504, Total=1406 [2023-12-02 17:47:54,672 INFO L87 Difference]: Start difference. First operand 1370 states and 1781 transitions. Second operand has 28 states, 24 states have (on average 5.875) internal successors, (141), 27 states have internal predecessors, (141), 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 17:48:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:48:14,544 INFO L93 Difference]: Finished difference Result 2306 states and 2740 transitions. [2023-12-02 17:48:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 17:48:14,546 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 5.875) internal successors, (141), 27 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 106 [2023-12-02 17:48:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:48:14,551 INFO L225 Difference]: With dead ends: 2306 [2023-12-02 17:48:14,552 INFO L226 Difference]: Without dead ends: 2306 [2023-12-02 17:48:14,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=235, Invalid=1346, Unknown=11, NotChecked=664, Total=2256 [2023-12-02 17:48:14,553 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 1529 mSDsluCounter, 6034 mSDsCounter, 0 mSdLazyCounter, 9077 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 6553 SdHoareTripleChecker+Invalid, 9113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 9077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:48:14,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 6553 Invalid, 9113 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [36 Valid, 9077 Invalid, 0 Unknown, 0 Unchecked, 19.2s Time] [2023-12-02 17:48:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2023-12-02 17:48:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1776. [2023-12-02 17:48:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1365 states have (on average 1.772161172161172) internal successors, (2419), 1756 states have internal predecessors, (2419), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-12-02 17:48:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2454 transitions. [2023-12-02 17:48:14,596 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2454 transitions. Word has length 106 [2023-12-02 17:48:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:48:14,596 INFO L495 AbstractCegarLoop]: Abstraction has 1776 states and 2454 transitions. [2023-12-02 17:48:14,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 5.875) internal successors, (141), 27 states have internal predecessors, (141), 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 17:48:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2454 transitions. [2023-12-02 17:48:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-02 17:48:14,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:48:14,598 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:48:14,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-12-02 17:48:14,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-12-02 17:48:15,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-12-02 17:48:15,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:48:15,199 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:48:15,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:48:15,199 INFO L85 PathProgramCache]: Analyzing trace with hash 773579427, now seen corresponding path program 1 times [2023-12-02 17:48:15,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:48:15,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815107542] [2023-12-02 17:48:15,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:48:15,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:48:15,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:48:15,201 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:48:15,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:48:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:48:16,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 17:48:16,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:48:16,034 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 17:48:16,144 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:48:16,145 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 17:48:16,153 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 17:48:16,183 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 17:48:16,191 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 17:48:16,288 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 17:48:16,292 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 17:48:16,938 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:48:16,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:48:16,945 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 17:48:17,065 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:48:17,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:48:17,072 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 17:48:17,089 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 17:48:17,095 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 17:48:17,119 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 17:48:17,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:48:17,258 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4268) |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 17:48:17,295 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_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 17:48:18,672 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4360))) (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~mem33#1.base| v_ArrVal_4359) .cse0 v_ArrVal_4268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4359) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-12-02 17:48:18,681 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:48:18,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815107542] [2023-12-02 17:48:18,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815107542] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:48:18,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1751833320] [2023-12-02 17:48:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:48:18,682 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:48:18,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:48:18,683 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:48:18,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-02 17:50:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:50:25,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 17:50:25,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:50:25,136 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 17:50:25,491 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:50:25,491 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 17:50:25,499 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 17:50:25,572 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 17:50:25,580 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 17:50:25,793 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 17:50:25,798 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 17:50:26,539 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:50:26,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:50:26,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 17:50:26,728 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:50:26,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:50:26,734 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 17:50:26,758 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 17:50:26,766 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 17:50:26,768 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 17:50:26,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:50:26,832 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 17:50:26,874 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_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4813) |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 17:50:28,379 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4905))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4904) .cse0 v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4904) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4905) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4813) |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 17:50:28,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1751833320] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:50:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194891657] [2023-12-02 17:50:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:50:28,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:50:28,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:50:28,393 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:50:28,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 17:50:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:50:29,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 17:50:29,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:50:29,034 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 17:50:29,149 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 17:50:29,164 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:50:29,164 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 17:50:29,176 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 17:50:29,190 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 17:50:29,249 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 17:50:29,254 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 17:50:30,019 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:50:30,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:50:30,030 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 17:50:30,125 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:50:30,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 17:50:30,139 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 17:50:30,156 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 17:50:30,163 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 17:50:30,168 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 17:50:30,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:50:30,224 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5357) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 17:50:30,265 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_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5357) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 17:50:31,715 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5450 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5450) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5450 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5449))) (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~mem33#1.base| v_ArrVal_5450) .cse2 v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5357) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 17:50:31,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194891657] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:50:31,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:50:31,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-12-02 17:50:31,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142774152] [2023-12-02 17:50:31,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:50:31,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 17:50:31,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:50:31,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 17:50:31,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=231, Unknown=9, NotChecked=342, Total=650 [2023-12-02 17:50:31,728 INFO L87 Difference]: Start difference. First operand 1776 states and 2454 transitions. Second operand has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 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 17:50:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:50:49,496 INFO L93 Difference]: Finished difference Result 2129 states and 2774 transitions. [2023-12-02 17:50:49,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 17:50:49,497 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2023-12-02 17:50:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:50:49,502 INFO L225 Difference]: With dead ends: 2129 [2023-12-02 17:50:49,502 INFO L226 Difference]: Without dead ends: 2129 [2023-12-02 17:50:49,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 304 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=378, Unknown=9, NotChecked=432, Total=930 [2023-12-02 17:50:49,503 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 1113 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 6416 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 6437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 6416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:50:49,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 2202 Invalid, 6437 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 6416 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2023-12-02 17:50:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2023-12-02 17:50:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1775. [2023-12-02 17:50:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1365 states have (on average 1.76996336996337) internal successors, (2416), 1755 states have internal predecessors, (2416), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-12-02 17:50:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2451 transitions. [2023-12-02 17:50:49,539 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2451 transitions. Word has length 106 [2023-12-02 17:50:49,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:50:49,540 INFO L495 AbstractCegarLoop]: Abstraction has 1775 states and 2451 transitions. [2023-12-02 17:50:49,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 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 17:50:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2451 transitions. [2023-12-02 17:50:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 17:50:49,541 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:50:49,542 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:50:49,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-12-02 17:50:49,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-12-02 17:50:49,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:50:50,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:50:50,144 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:50:50,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:50:50,145 INFO L85 PathProgramCache]: Analyzing trace with hash 382009965, now seen corresponding path program 1 times [2023-12-02 17:50:50,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:50:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597925800] [2023-12-02 17:50:50,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:50:50,146 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 17:50:50,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:50:50,146 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:50:50,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:50:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:50:51,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 17:50:51,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:50:51,116 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 17:50:51,238 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 17:50:51,238 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 17:50:51,278 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 17:50:51,416 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 17:50:52,337 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:50:52,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:50:52,457 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:50:52,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:50:52,554 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:50:52,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:50:52,568 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 17:50:52,609 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 17:50:52,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:50:52,670 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5873) |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 17:50:52,681 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5873 (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_5873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-12-02 17:50:52,696 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5872))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5873)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 17:50:52,709 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5873 (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_5872))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5873)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 17:50:53,103 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5919))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5872)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5873)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 17:50:53,107 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:50:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597925800] [2023-12-02 17:50:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597925800] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:50:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1565920067] [2023-12-02 17:50:53,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:50:53,107 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:50:53,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:50:53,108 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:50:53,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-12-02 17:51:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:51:20,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 17:51:20,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:51:20,296 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 17:51:20,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 17:51:20,825 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 17:51:20,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 17:51:20,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:51:21,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-02 17:51:22,730 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:51:22,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 17:51:22,988 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:51:22,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 17:51:23,132 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:51:23,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 17:51:23,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-02 17:51:23,256 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 17:51:23,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:51:23,274 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6342) |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 17:51:23,287 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6342) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-12-02 17:51:23,304 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6341))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6342)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 17:51:23,320 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6341))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6342)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 17:51:23,800 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6388))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6341)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6342)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 17:51:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1565920067] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:51:23,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176335825] [2023-12-02 17:51:23,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:51:23,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:51:23,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:51:23,805 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:51:23,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 17:51:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:51:24,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 17:51:24,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:51:24,677 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:51:24,678 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 17:51:24,727 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 17:51:25,180 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:51:25,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 31 treesize of output 32 [2023-12-02 17:51:25,282 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:51:25,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:51:25,378 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:51:25,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:51:25,453 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 17:51:25,457 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 17:51:25,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:51:25,483 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 17:51:25,483 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 17:51:25,491 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6809) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2023-12-02 17:51:25,503 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6809 (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_6809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 17:51:25,516 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6808)) (.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_6809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 17:51:25,545 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (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_6808))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 17:51:25,966 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (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~mem33#1.base| v_ArrVal_6855))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6808)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 17:51:25,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176335825] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:51:25,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:51:25,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2023-12-02 17:51:25,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920431275] [2023-12-02 17:51:25,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:51:25,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 17:51:25,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:51:25,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 17:51:25,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=795, Unknown=15, NotChecked=1080, Total=2070 [2023-12-02 17:51:25,972 INFO L87 Difference]: Start difference. First operand 1775 states and 2451 transitions. Second operand has 30 states, 26 states have (on average 5.653846153846154) internal successors, (147), 30 states have internal predecessors, (147), 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 17:51:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:51:46,734 INFO L93 Difference]: Finished difference Result 2302 states and 2734 transitions. [2023-12-02 17:51:46,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 17:51:46,736 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 5.653846153846154) internal successors, (147), 30 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 108 [2023-12-02 17:51:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:51:46,744 INFO L225 Difference]: With dead ends: 2302 [2023-12-02 17:51:46,744 INFO L226 Difference]: Without dead ends: 2302 [2023-12-02 17:51:46,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 299 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=227, Invalid=1078, Unknown=15, NotChecked=1230, Total=2550 [2023-12-02 17:51:46,745 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 1524 mSDsluCounter, 5524 mSDsCounter, 0 mSdLazyCounter, 8343 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 6043 SdHoareTripleChecker+Invalid, 8387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 8343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:51:46,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 6043 Invalid, 8387 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 8343 Invalid, 0 Unknown, 0 Unchecked, 20.3s Time] [2023-12-02 17:51:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2023-12-02 17:51:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 1774. [2023-12-02 17:51:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1365 states have (on average 1.7677655677655677) internal successors, (2413), 1754 states have internal predecessors, (2413), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-12-02 17:51:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2448 transitions. [2023-12-02 17:51:46,770 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2448 transitions. Word has length 108 [2023-12-02 17:51:46,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:51:46,770 INFO L495 AbstractCegarLoop]: Abstraction has 1774 states and 2448 transitions. [2023-12-02 17:51:46,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 5.653846153846154) internal successors, (147), 30 states have internal predecessors, (147), 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 17:51:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2448 transitions. [2023-12-02 17:51:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 17:51:46,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:51:46,771 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:51:46,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-12-02 17:51:46,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-12-02 17:51:47,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-12-02 17:51:47,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:51:47,373 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:51:47,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:51:47,373 INFO L85 PathProgramCache]: Analyzing trace with hash 382009966, now seen corresponding path program 1 times [2023-12-02 17:51:47,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:51:47,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666273838] [2023-12-02 17:51:47,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:51:47,374 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 17:51:47,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:51:47,375 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:51:47,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:51:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:51:48,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 17:51:48,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:51:48,587 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 17:51:48,707 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 17:51:48,721 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:51:48,721 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 17:51:48,747 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 17:51:48,753 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 17:51:48,881 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 17:51:48,886 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 17:51:49,635 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:51:49,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:51:49,649 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 17:51:49,772 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:51:49,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:51:49,785 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 17:51:49,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:51:49,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:51:49,897 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 17:51:49,910 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 17:51:49,916 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 17:51:49,951 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 17:51:49,951 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:51:50,150 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 17:51:50,189 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_7324 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 17:51:50,235 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7322))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7323) .cse0 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7323) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7324) |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 17:51:50,289 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7322))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7323) .cse1 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7323) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 17:51:57,584 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:51:57,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666273838] [2023-12-02 17:51:57,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666273838] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:51:57,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1084168701] [2023-12-02 17:51:57,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:51:57,584 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:51:57,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:51:57,585 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:51:57,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-12-02 17:53:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:53:09,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 17:53:09,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:53:09,916 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 17:53:10,896 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:53:10,896 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 17:53:10,927 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 17:53:11,112 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 17:53:11,158 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 17:53:11,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 17:53:11,594 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 17:53:13,214 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:53:13,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:53:13,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 17:53:13,774 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:53:13,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 17:53:13,788 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 17:53:14,154 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:53:14,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:53:14,168 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 17:53:14,234 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 17:53:14,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 17:53:14,261 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 17:53:14,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:53:14,384 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7887) |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 17:53:14,457 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_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 17:53:14,547 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7885))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7884) .cse0 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7884) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7887) |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 17:53:14,644 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7885))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7884) .cse1 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7884) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 17:53:18,126 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7978))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7885))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7979) .cse0 v_ArrVal_7884) .cse1 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7978))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7979) .cse6 v_ArrVal_7884) (select (select (store .cse7 .cse6 v_ArrVal_7885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7887))) |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 17:53:18,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1084168701] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:53:18,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960002430] [2023-12-02 17:53:18,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:53:18,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:53:18,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:53:18,150 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:53:18,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-12-02 17:53:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:53:18,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 17:53:18,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:53:18,892 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 17:53:19,264 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 17:53:19,315 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:53:19,316 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 17:53:19,357 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 17:53:19,368 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 17:53:19,491 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 17:53:19,501 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 17:53:21,179 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:53:21,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 62 treesize of output 57 [2023-12-02 17:53:21,208 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 17:53:21,366 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:53:21,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:53:21,393 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 17:53:21,492 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:53:21,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:53:21,521 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 17:53:21,543 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 17:53:21,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 9 treesize of output 3 [2023-12-02 17:53:21,567 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 17:53:21,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:53:21,655 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8448 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 17:53:21,710 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_8449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8448 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 17:53:21,788 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8446) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8447))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8446) .cse2 v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 17:53:21,862 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8447))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8446) .cse1 v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8446) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 17:53:24,044 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8541 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8540))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8541) .cse1 v_ArrVal_8446) (select (select (store .cse2 .cse1 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8449))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8541 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8540))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8447))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8541) .cse4 v_ArrVal_8446) .cse5 v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 17:53:24,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960002430] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:53:24,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:53:24,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2023-12-02 17:53:24,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798630876] [2023-12-02 17:53:24,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:53:24,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 17:53:24,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:53:24,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 17:53:24,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=323, Unknown=21, NotChecked=686, Total=1122 [2023-12-02 17:53:24,066 INFO L87 Difference]: Start difference. First operand 1774 states and 2448 transitions. Second operand has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 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 17:53:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:53:56,723 INFO L93 Difference]: Finished difference Result 2127 states and 2768 transitions. [2023-12-02 17:53:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 17:53:56,724 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-12-02 17:53:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:53:56,728 INFO L225 Difference]: With dead ends: 2127 [2023-12-02 17:53:56,728 INFO L226 Difference]: Without dead ends: 2127 [2023-12-02 17:53:56,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 308 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=146, Invalid=539, Unknown=21, NotChecked=854, Total=1560 [2023-12-02 17:53:56,729 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 1585 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 6335 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 6364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.8s IncrementalHoareTripleChecker+Time [2023-12-02 17:53:56,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 2113 Invalid, 6364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 6335 Invalid, 0 Unknown, 0 Unchecked, 31.8s Time] [2023-12-02 17:53:56,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2023-12-02 17:53:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1773. [2023-12-02 17:53:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1365 states have (on average 1.7655677655677655) internal successors, (2410), 1753 states have internal predecessors, (2410), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-12-02 17:53:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2445 transitions. [2023-12-02 17:53:56,755 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2445 transitions. Word has length 108 [2023-12-02 17:53:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:53:56,755 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2445 transitions. [2023-12-02 17:53:56,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 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 17:53:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2445 transitions. [2023-12-02 17:53:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 17:53:56,756 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:53:56,756 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 17:53:56,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-12-02 17:53:56,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2023-12-02 17:53:57,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:53:57,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:53:57,357 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:53:57,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:53:57,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2040875411, now seen corresponding path program 1 times [2023-12-02 17:53:57,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:53:57,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610112722] [2023-12-02 17:53:57,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:53:57,358 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 17:53:57,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:53:57,359 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:53:57,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:53:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:53:58,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 17:53:58,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:53:58,692 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 17:53:59,098 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 17:53:59,098 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 17:53:59,193 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 17:53:59,403 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 17:54:01,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:54:01,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:54:01,711 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:54:01,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 17:54:01,909 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:54:01,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:54:02,134 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:54:02,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:54:02,162 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 17:54:02,263 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 17:54:02,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:54:02,423 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8980) |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 17:54:02,451 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (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_8980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 17:54:02,482 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8979))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 17:54:02,517 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (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_8979))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 17:54:02,559 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8978))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 17:54:02,606 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8978))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 17:54:03,373 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9026))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8978)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 17:54:03,381 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:54:03,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610112722] [2023-12-02 17:54:03,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610112722] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:54:03,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1442056037] [2023-12-02 17:54:03,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:54:03,381 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:54:03,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:54:03,382 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:54:03,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-12-02 17:55:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:55:27,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 17:55:27,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:55:27,602 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 17:55:27,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 17:55:28,909 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 17:55:28,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 17:55:29,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:55:29,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-02 17:55:32,875 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:55:32,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 17:55:33,398 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:55:33,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 17:55:33,753 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:55:33,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 17:55:34,114 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:55:34,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 17:55:34,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-02 17:55:34,346 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 17:55:34,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:55:36,118 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9465 (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_9465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 17:55:36,150 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9464))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 17:55:36,181 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9464))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 17:55:36,215 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9463))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9464)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 17:55:36,252 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9463))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9464)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 17:55:37,021 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9511 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9511))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9463)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9464)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 17:55:37,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1442056037] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:55:37,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755090926] [2023-12-02 17:55:37,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:55:37,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:55:37,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:55:37,031 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:55:37,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-12-02 17:55:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:55:37,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 17:55:37,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:55:37,750 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 17:55:38,104 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:55:38,104 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 17:55:38,227 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 17:55:39,341 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:55:39,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 17:55:39,570 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:55:39,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:55:39,780 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:55:39,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:55:40,012 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:55:40,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:55:40,201 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 17:55:40,210 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 17:55:40,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:55:40,266 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 17:55:40,266 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 17:55:40,282 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem37#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9949) |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 17:55:40,303 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (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_9949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 17:55:40,327 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9948)) (.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_9949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 17:55:40,351 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9948 (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_9948))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_9949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 17:55:40,379 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9947))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9948)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_9949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 17:55:40,408 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9947))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9948)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_9949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 17:55:41,104 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9995 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9995))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9947)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9948)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_9949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 17:55:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755090926] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:55:41,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:55:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2023-12-02 17:55:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064161617] [2023-12-02 17:55:41,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:55:41,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 17:55:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:55:41,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 17:55:41,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1029, Unknown=23, NotChecked=1700, Total=2970 [2023-12-02 17:55:41,113 INFO L87 Difference]: Start difference. First operand 1773 states and 2445 transitions. Second operand has 33 states, 29 states have (on average 5.172413793103448) internal successors, (150), 33 states have internal predecessors, (150), 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 17:56:25,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:56:25,940 INFO L93 Difference]: Finished difference Result 2298 states and 2728 transitions. [2023-12-02 17:56:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 17:56:25,941 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 5.172413793103448) internal successors, (150), 33 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 110 [2023-12-02 17:56:25,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:56:25,945 INFO L225 Difference]: With dead ends: 2298 [2023-12-02 17:56:25,945 INFO L226 Difference]: Without dead ends: 2298 [2023-12-02 17:56:25,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 302 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=266, Invalid=1351, Unknown=23, NotChecked=1900, Total=3540 [2023-12-02 17:56:25,947 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 2199 mSDsluCounter, 6055 mSDsCounter, 0 mSdLazyCounter, 9187 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 6573 SdHoareTripleChecker+Invalid, 9244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 9187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:56:25,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 6573 Invalid, 9244 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 9187 Invalid, 0 Unknown, 0 Unchecked, 44.0s Time] [2023-12-02 17:56:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2023-12-02 17:56:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1772. [2023-12-02 17:56:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1365 states have (on average 1.7633699633699633) internal successors, (2407), 1752 states have internal predecessors, (2407), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-12-02 17:56:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2442 transitions. [2023-12-02 17:56:25,973 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2442 transitions. Word has length 110 [2023-12-02 17:56:25,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:56:25,973 INFO L495 AbstractCegarLoop]: Abstraction has 1772 states and 2442 transitions. [2023-12-02 17:56:25,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 5.172413793103448) internal successors, (150), 33 states have internal predecessors, (150), 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 17:56:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2442 transitions. [2023-12-02 17:56:25,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 17:56:25,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:56:25,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] [2023-12-02 17:56:25,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:56:26,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2023-12-02 17:56:26,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2023-12-02 17:56:26,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 17:56:26,575 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 17:56:26,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:56:26,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2040875412, now seen corresponding path program 1 times [2023-12-02 17:56:26,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:56:26,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411822725] [2023-12-02 17:56:26,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:56:26,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 17:56:26,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:56:26,577 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:56:26,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 17:56:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:56:27,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 118 conjunts are in the unsatisfiable core [2023-12-02 17:56:27,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:56:27,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 17:56:28,251 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:56:28,251 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 17:56:28,275 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 17:56:28,336 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 17:56:28,356 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 17:56:28,616 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 17:56:28,626 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 17:56:30,333 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:56:30,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:56:30,362 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 17:56:30,622 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:56:30,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:56:30,652 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 17:56:30,863 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:56:30,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:56:30,883 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 17:56:31,106 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:56:31,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:56:31,135 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 17:56:31,160 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 17:56:31,176 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 17:56:31,259 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 17:56:31,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:56:31,588 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-12-02 17:56:31,647 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_10481 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 17:56:31,716 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10480))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10479) .cse0 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10479) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10481) |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 17:56:31,795 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10480))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10479) .cse1 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10479) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-12-02 17:56:31,883 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10477))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10480))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10478) .cse0 v_ArrVal_10479) .cse1 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10477))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10478) .cse6 v_ArrVal_10479) (select (select (store .cse7 .cse6 v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10481))) |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 17:56:31,981 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_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10477))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10478) .cse2 v_ArrVal_10479) (select (select (store .cse3 .cse2 v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10481))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10477))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10480))) (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_10478) .cse5 v_ArrVal_10479) .cse6 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 17:56:34,006 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10574 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10574))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10477))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10573) .cse1 v_ArrVal_10478) .cse2 v_ArrVal_10479) (select (select (store .cse3 .cse2 v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10481))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10574 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10574))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_10477))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_10480))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10573) .cse6 v_ArrVal_10478) .cse7 v_ArrVal_10479) .cse8 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-12-02 17:56:34,026 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:56:34,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411822725] [2023-12-02 17:56:34,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411822725] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:56:34,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1598583144] [2023-12-02 17:56:34,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:56:34,027 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:56:34,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:56:34,028 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:56:34,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b09f27d-07c5-49dc-91d3-faeb98b9705c/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process