./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --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 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 04:58:18,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 04:58:18,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 04:58:18,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 04:58:18,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 04:58:18,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 04:58:18,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 04:58:18,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 04:58:18,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 04:58:18,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 04:58:18,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 04:58:18,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 04:58:18,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 04:58:18,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 04:58:18,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 04:58:18,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 04:58:18,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 04:58:18,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 04:58:18,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 04:58:18,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 04:58:18,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 04:58:18,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 04:58:18,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 04:58:18,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 04:58:18,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 04:58:18,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 04:58:18,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 04:58:18,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 04:58:18,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 04:58:18,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 04:58:18,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 04:58:18,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 04:58:18,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 04:58:18,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 04:58:18,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 04:58:18,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 04:58:18,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 04:58:18,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 04:58:18,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 04:58:18,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 04:58:18,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 04:58:18,060 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 04:58:18,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 04:58:18,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 04:58:18,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 04:58:18,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 04:58:18,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 04:58:18,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 04:58:18,075 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 04:58:18,075 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 04:58:18,075 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 04:58:18,075 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 04:58:18,076 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 04:58:18,076 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 04:58:18,076 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 04:58:18,076 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 04:58:18,076 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 04:58:18,076 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 04:58:18,076 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 04:58:18,077 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 04:58:18,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 04:58:18,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 04:58:18,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 04:58:18,077 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 04:58:18,078 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 04:58:18,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 04:58:18,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 04:58:18,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 04:58:18,078 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 04:58:18,078 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 04:58:18,078 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 04:58:18,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 04:58:18,079 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 04:58:18,079 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 04:58:18,079 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 04:58:18,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 04:58:18,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 04:58:18,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:58:18,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 04:58:18,080 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 04:58:18,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 04:58:18,080 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 04:58:18,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 04:58:18,080 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 04:58:18,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/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_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 [2022-12-14 04:58:18,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 04:58:18,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 04:58:18,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 04:58:18,267 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 04:58:18,268 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 04:58:18,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2022-12-14 04:58:20,827 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 04:58:21,089 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 04:58:21,090 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2022-12-14 04:58:21,104 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/data/6bbd545cf/b5ba59ff3d72475ab6b255fc36d39ddb/FLAG051489bcf [2022-12-14 04:58:21,385 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/data/6bbd545cf/b5ba59ff3d72475ab6b255fc36d39ddb [2022-12-14 04:58:21,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 04:58:21,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 04:58:21,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 04:58:21,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 04:58:21,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 04:58:21,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:58:21" (1/1) ... [2022-12-14 04:58:21,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea5259f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:21, skipping insertion in model container [2022-12-14 04:58:21,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:58:21" (1/1) ... [2022-12-14 04:58:21,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 04:58:21,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 04:58:21,795 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i[33022,33035] [2022-12-14 04:58:21,896 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:21,911 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:21,926 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:21,940 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:21,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:58:21,960 ERROR L326 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) [2022-12-14 04:58:21,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@39b4717b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:21, skipping insertion in model container [2022-12-14 04:58:21,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 04:58:21,961 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-14 04:58:21,963 INFO L158 Benchmark]: Toolchain (without parser) took 572.06ms. Allocated memory is still 207.6MB. Free memory was 173.3MB in the beginning and 145.9MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 04:58:21,964 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 04:58:21,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.31ms. Allocated memory is still 207.6MB. Free memory was 173.3MB in the beginning and 145.9MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 04:58:21,966 INFO L339 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 109.1MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.31ms. Allocated memory is still 207.6MB. Free memory was 173.3MB in the beginning and 145.9MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --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 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 04:58:23,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 04:58:23,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 04:58:23,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 04:58:23,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 04:58:23,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 04:58:23,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 04:58:23,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 04:58:23,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 04:58:23,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 04:58:23,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 04:58:23,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 04:58:23,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 04:58:23,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 04:58:23,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 04:58:23,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 04:58:23,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 04:58:23,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 04:58:23,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 04:58:23,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 04:58:23,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 04:58:23,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 04:58:23,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 04:58:23,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 04:58:23,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 04:58:23,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 04:58:23,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 04:58:23,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 04:58:23,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 04:58:23,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 04:58:23,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 04:58:23,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 04:58:23,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 04:58:23,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 04:58:23,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 04:58:23,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 04:58:23,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 04:58:23,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 04:58:23,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 04:58:23,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 04:58:23,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 04:58:23,304 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 04:58:23,327 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 04:58:23,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 04:58:23,328 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 04:58:23,328 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 04:58:23,328 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 04:58:23,329 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 04:58:23,329 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 04:58:23,329 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 04:58:23,329 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 04:58:23,329 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 04:58:23,330 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 04:58:23,330 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 04:58:23,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 04:58:23,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 04:58:23,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 04:58:23,331 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 04:58:23,331 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 04:58:23,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 04:58:23,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 04:58:23,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 04:58:23,332 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 04:58:23,332 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 04:58:23,332 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 04:58:23,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 04:58:23,333 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 04:58:23,333 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 04:58:23,333 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 04:58:23,333 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 04:58:23,334 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 04:58:23,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 04:58:23,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 04:58:23,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 04:58:23,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:58:23,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 04:58:23,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 04:58:23,335 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 04:58:23,335 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 04:58:23,335 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 04:58:23,336 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 04:58:23,336 INFO L138 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_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/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_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 [2022-12-14 04:58:23,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 04:58:23,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 04:58:23,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 04:58:23,577 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 04:58:23,577 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 04:58:23,578 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2022-12-14 04:58:26,195 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 04:58:26,408 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 04:58:26,408 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2022-12-14 04:58:26,420 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/data/0d7f1edb1/68aec2de19074badacac232351bdde77/FLAGc5a92021a [2022-12-14 04:58:26,432 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/data/0d7f1edb1/68aec2de19074badacac232351bdde77 [2022-12-14 04:58:26,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 04:58:26,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 04:58:26,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 04:58:26,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 04:58:26,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 04:58:26,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:58:26" (1/1) ... [2022-12-14 04:58:26,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e0a4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:26, skipping insertion in model container [2022-12-14 04:58:26,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:58:26" (1/1) ... [2022-12-14 04:58:26,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 04:58:26,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 04:58:26,784 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i[33022,33035] [2022-12-14 04:58:26,863 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:26,873 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:26,883 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:26,892 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:26,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:58:26,908 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-14 04:58:26,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 04:58:26,930 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i[33022,33035] [2022-12-14 04:58:26,982 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:26,992 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:27,000 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:27,009 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:27,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:58:27,017 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 04:58:27,041 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i[33022,33035] [2022-12-14 04:58:27,085 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:27,093 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:27,102 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:27,110 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:58:27,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:58:27,156 INFO L208 MainTranslator]: Completed translation [2022-12-14 04:58:27,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:27 WrapperNode [2022-12-14 04:58:27,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 04:58:27,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 04:58:27,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 04:58:27,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 04:58:27,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:27" (1/1) ... [2022-12-14 04:58:27,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:27" (1/1) ... [2022-12-14 04:58:27,269 INFO L138 Inliner]: procedures = 180, calls = 524, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2176 [2022-12-14 04:58:27,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 04:58:27,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 04:58:27,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 04:58:27,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 04:58:27,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:27" (1/1) ... [2022-12-14 04:58:27,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:27" (1/1) ... [2022-12-14 04:58:27,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:27" (1/1) ... [2022-12-14 04:58:27,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:27" (1/1) ... [2022-12-14 04:58:27,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:27" (1/1) ... [2022-12-14 04:58:27,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:27" (1/1) ... [2022-12-14 04:58:27,374 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:27" (1/1) ... [2022-12-14 04:58:27,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:27" (1/1) ... [2022-12-14 04:58:27,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 04:58:27,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 04:58:27,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 04:58:27,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 04:58:27,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:27" (1/1) ... [2022-12-14 04:58:27,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:58:27,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:27,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 04:58:27,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 04:58:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-14 04:58:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-12-14 04:58:27,449 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-12-14 04:58:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 04:58:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 04:58:27,450 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 04:58:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-14 04:58:27,450 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-14 04:58:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 04:58:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 04:58:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 04:58:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 04:58:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-12-14 04:58:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 04:58:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 04:58:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 04:58:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 04:58:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 04:58:27,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 04:58:27,666 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 04:58:27,667 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 04:58:27,670 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-14 04:58:34,160 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 04:58:34,176 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 04:58:34,176 INFO L300 CfgBuilder]: Removed 151 assume(true) statements. [2022-12-14 04:58:34,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:58:34 BoogieIcfgContainer [2022-12-14 04:58:34,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 04:58:34,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 04:58:34,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 04:58:34,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 04:58:34,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:58:26" (1/3) ... [2022-12-14 04:58:34,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64860029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:58:34, skipping insertion in model container [2022-12-14 04:58:34,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:27" (2/3) ... [2022-12-14 04:58:34,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64860029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:58:34, skipping insertion in model container [2022-12-14 04:58:34,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:58:34" (3/3) ... [2022-12-14 04:58:34,184 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-1.i [2022-12-14 04:58:34,197 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 04:58:34,197 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 990 error locations. [2022-12-14 04:58:34,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 04:58:34,253 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;@5a8b0ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 04:58:34,254 INFO L358 AbstractCegarLoop]: Starting to check reachability of 990 error locations. [2022-12-14 04:58:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 2058 states, 1056 states have (on average 2.2045454545454546) internal successors, (2328), 2044 states have internal predecessors, (2328), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-14 04:58:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 04:58:34,264 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:34,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 04:58:34,264 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:58:34,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:34,268 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-12-14 04:58:34,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:58:34,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551353289] [2022-12-14 04:58:34,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:34,277 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 [2022-12-14 04:58:34,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:58:34,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:58:34,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:58:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:34,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:58:34,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:34,498 INFO L350 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 [2022-12-14 04:58:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:58:34,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:34,511 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:58:34,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551353289] [2022-12-14 04:58:34,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551353289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:34,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:34,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:58:34,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132328125] [2022-12-14 04:58:34,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:34,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:58:34,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:58:34,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:58:34,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:58:34,552 INFO L87 Difference]: Start difference. First operand has 2058 states, 1056 states have (on average 2.2045454545454546) internal successors, (2328), 2044 states have internal predecessors, (2328), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:58:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:37,646 INFO L93 Difference]: Finished difference Result 2555 states and 2718 transitions. [2022-12-14 04:58:37,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:58:37,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 04:58:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:37,667 INFO L225 Difference]: With dead ends: 2555 [2022-12-14 04:58:37,667 INFO L226 Difference]: Without dead ends: 2553 [2022-12-14 04:58:37,668 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 [2022-12-14 04:58:37,671 INFO L413 NwaCegarLoop]: 1269 mSDtfsCounter, 1947 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:37,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1957 Valid, 1640 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-14 04:58:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2022-12-14 04:58:37,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2200. [2022-12-14 04:58:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 1222 states have (on average 2.037643207855974) internal successors, (2490), 2184 states have internal predecessors, (2490), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 04:58:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 2522 transitions. [2022-12-14 04:58:37,768 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 2522 transitions. Word has length 3 [2022-12-14 04:58:37,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:37,769 INFO L495 AbstractCegarLoop]: Abstraction has 2200 states and 2522 transitions. [2022-12-14 04:58:37,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:58:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 2522 transitions. [2022-12-14 04:58:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 04:58:37,769 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:37,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 04:58:37,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:58:37,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:58:37,972 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:58:37,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:37,974 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-12-14 04:58:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:58:37,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175008843] [2022-12-14 04:58:37,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:37,977 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 [2022-12-14 04:58:37,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:58:37,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:58:37,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:58:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:38,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 04:58:38,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:38,153 INFO L350 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 [2022-12-14 04:58:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:58:38,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:38,163 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:58:38,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175008843] [2022-12-14 04:58:38,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175008843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:38,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:38,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:58:38,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277386100] [2022-12-14 04:58:38,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:38,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:58:38,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:58:38,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:58:38,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:58:38,166 INFO L87 Difference]: Start difference. First operand 2200 states and 2522 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:58:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:42,851 INFO L93 Difference]: Finished difference Result 2971 states and 3374 transitions. [2022-12-14 04:58:42,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:58:42,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 04:58:42,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:42,861 INFO L225 Difference]: With dead ends: 2971 [2022-12-14 04:58:42,861 INFO L226 Difference]: Without dead ends: 2971 [2022-12-14 04:58:42,862 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 [2022-12-14 04:58:42,863 INFO L413 NwaCegarLoop]: 1833 mSDtfsCounter, 844 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:42,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 3009 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-12-14 04:58:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2022-12-14 04:58:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2649. [2022-12-14 04:58:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 1669 states have (on average 1.9970041941282204) internal successors, (3333), 2630 states have internal predecessors, (3333), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 04:58:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 3371 transitions. [2022-12-14 04:58:42,929 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 3371 transitions. Word has length 3 [2022-12-14 04:58:42,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:42,930 INFO L495 AbstractCegarLoop]: Abstraction has 2649 states and 3371 transitions. [2022-12-14 04:58:42,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:58:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3371 transitions. [2022-12-14 04:58:42,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 04:58:42,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:42,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:42,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:58:43,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:58:43,131 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:58:43,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:43,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-12-14 04:58:43,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:58:43,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633456705] [2022-12-14 04:58:43,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:43,132 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 [2022-12-14 04:58:43,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:58:43,133 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:58:43,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:58:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:43,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 04:58:43,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:43,277 INFO L350 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 [2022-12-14 04:58:43,283 INFO L350 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 [2022-12-14 04:58:43,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:58:43,340 INFO L350 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 12 treesize of output 14 [2022-12-14 04:58:43,357 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 04:58:43,357 INFO L350 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 [2022-12-14 04:58:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:58:43,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:43,379 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:58:43,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633456705] [2022-12-14 04:58:43,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633456705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:43,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:43,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:58:43,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698300482] [2022-12-14 04:58:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:43,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:58:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:58:43,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:58:43,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:58:43,381 INFO L87 Difference]: Start difference. First operand 2649 states and 3371 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:58:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:51,275 INFO L93 Difference]: Finished difference Result 4902 states and 5774 transitions. [2022-12-14 04:58:51,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:58:51,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 04:58:51,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:51,284 INFO L225 Difference]: With dead ends: 4902 [2022-12-14 04:58:51,284 INFO L226 Difference]: Without dead ends: 4902 [2022-12-14 04:58:51,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:58:51,285 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 4299 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4309 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:51,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4309 Valid, 2059 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-12-14 04:58:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2022-12-14 04:58:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 3366. [2022-12-14 04:58:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3366 states, 2386 states have (on average 2.0352053646269908) internal successors, (4856), 3341 states have internal predecessors, (4856), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:58:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 4906 transitions. [2022-12-14 04:58:51,339 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 4906 transitions. Word has length 7 [2022-12-14 04:58:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:51,339 INFO L495 AbstractCegarLoop]: Abstraction has 3366 states and 4906 transitions. [2022-12-14 04:58:51,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:58:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 4906 transitions. [2022-12-14 04:58:51,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 04:58:51,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:51,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:51,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:58:51,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:58:51,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:58:51,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:51,544 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-12-14 04:58:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:58:51,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559571325] [2022-12-14 04:58:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:51,546 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 [2022-12-14 04:58:51,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:58:51,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:58:51,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:58:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:51,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:58:51,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:51,780 INFO L350 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 [2022-12-14 04:58:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:58:51,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:51,791 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:58:51,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559571325] [2022-12-14 04:58:51,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559571325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:51,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:51,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:58:51,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466624644] [2022-12-14 04:58:51,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:51,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:58:51,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:58:51,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:58:51,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:58:51,793 INFO L87 Difference]: Start difference. First operand 3366 states and 4906 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:58:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:54,641 INFO L93 Difference]: Finished difference Result 4570 states and 6423 transitions. [2022-12-14 04:58:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:58:54,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 04:58:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:54,649 INFO L225 Difference]: With dead ends: 4570 [2022-12-14 04:58:54,649 INFO L226 Difference]: Without dead ends: 4570 [2022-12-14 04:58:54,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:58:54,652 INFO L413 NwaCegarLoop]: 1962 mSDtfsCounter, 1994 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:54,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2004 Valid, 2617 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-12-14 04:58:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2022-12-14 04:58:54,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 3275. [2022-12-14 04:58:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 2386 states have (on average 1.9459346186085498) internal successors, (4643), 3250 states have internal predecessors, (4643), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:58:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4693 transitions. [2022-12-14 04:58:54,695 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4693 transitions. Word has length 8 [2022-12-14 04:58:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:54,695 INFO L495 AbstractCegarLoop]: Abstraction has 3275 states and 4693 transitions. [2022-12-14 04:58:54,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:58:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4693 transitions. [2022-12-14 04:58:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 04:58:54,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:54,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:54,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-14 04:58:54,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:58:54,897 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:58:54,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-12-14 04:58:54,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:58:54,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584791789] [2022-12-14 04:58:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:54,898 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 [2022-12-14 04:58:54,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:58:54,899 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:58:54,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:58:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:55,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 04:58:55,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:55,011 INFO L350 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 [2022-12-14 04:58:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:58:55,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:55,036 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:58:55,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584791789] [2022-12-14 04:58:55,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584791789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:55,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:55,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:58:55,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179777420] [2022-12-14 04:58:55,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:55,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:58:55,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:58:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:58:55,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:58:55,038 INFO L87 Difference]: Start difference. First operand 3275 states and 4693 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:59:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:00,017 INFO L93 Difference]: Finished difference Result 4992 states and 7052 transitions. [2022-12-14 04:59:00,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:59:00,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 04:59:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:00,026 INFO L225 Difference]: With dead ends: 4992 [2022-12-14 04:59:00,027 INFO L226 Difference]: Without dead ends: 4992 [2022-12-14 04:59:00,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:59:00,028 INFO L413 NwaCegarLoop]: 2343 mSDtfsCounter, 1371 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 3327 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:00,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 3327 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-12-14 04:59:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2022-12-14 04:59:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 3597. [2022-12-14 04:59:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3597 states, 2718 states have (on average 1.9334069168506254) internal successors, (5255), 3572 states have internal predecessors, (5255), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 5305 transitions. [2022-12-14 04:59:00,073 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 5305 transitions. Word has length 8 [2022-12-14 04:59:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:00,073 INFO L495 AbstractCegarLoop]: Abstraction has 3597 states and 5305 transitions. [2022-12-14 04:59:00,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:59:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 5305 transitions. [2022-12-14 04:59:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 04:59:00,073 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:00,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:59:00,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:00,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:00,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:00,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:00,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1045354379, now seen corresponding path program 1 times [2022-12-14 04:59:00,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:00,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194647076] [2022-12-14 04:59:00,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:00,280 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 [2022-12-14 04:59:00,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:00,284 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:00,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:00,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 04:59:00,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:00,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:00,452 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:00,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194647076] [2022-12-14 04:59:00,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194647076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:00,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:00,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:59:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988388648] [2022-12-14 04:59:00,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:00,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:59:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:59:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:59:00,454 INFO L87 Difference]: Start difference. First operand 3597 states and 5305 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) [2022-12-14 04:59:00,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:00,489 INFO L93 Difference]: Finished difference Result 3537 states and 5219 transitions. [2022-12-14 04:59:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:59:00,489 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 [2022-12-14 04:59:00,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:00,499 INFO L225 Difference]: With dead ends: 3537 [2022-12-14 04:59:00,499 INFO L226 Difference]: Without dead ends: 3537 [2022-12-14 04:59:00,499 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 [2022-12-14 04:59:00,500 INFO L413 NwaCegarLoop]: 2007 mSDtfsCounter, 801 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 3219 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:00,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 3219 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:59:00,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2022-12-14 04:59:00,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3537. [2022-12-14 04:59:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3537 states, 2682 states have (on average 1.9272930648769575) internal successors, (5169), 3512 states have internal predecessors, (5169), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 5219 transitions. [2022-12-14 04:59:00,540 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 5219 transitions. Word has length 11 [2022-12-14 04:59:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:00,540 INFO L495 AbstractCegarLoop]: Abstraction has 3537 states and 5219 transitions. [2022-12-14 04:59:00,540 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) [2022-12-14 04:59:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 5219 transitions. [2022-12-14 04:59:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 04:59:00,540 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:00,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:59:00,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:00,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:00,742 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:00,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:00,744 INFO L85 PathProgramCache]: Analyzing trace with hash 436842575, now seen corresponding path program 1 times [2022-12-14 04:59:00,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:00,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899383500] [2022-12-14 04:59:00,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:00,746 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 [2022-12-14 04:59:00,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:00,749 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:00,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:01,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:59:01,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:01,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:01,031 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:01,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899383500] [2022-12-14 04:59:01,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899383500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:01,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:01,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:59:01,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094000221] [2022-12-14 04:59:01,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:01,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:01,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:01,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:01,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:01,032 INFO L87 Difference]: Start difference. First operand 3537 states and 5219 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) [2022-12-14 04:59:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:01,113 INFO L93 Difference]: Finished difference Result 3509 states and 5163 transitions. [2022-12-14 04:59:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:59:01,114 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 [2022-12-14 04:59:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:01,119 INFO L225 Difference]: With dead ends: 3509 [2022-12-14 04:59:01,119 INFO L226 Difference]: Without dead ends: 3509 [2022-12-14 04:59:01,119 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 [2022-12-14 04:59:01,120 INFO L413 NwaCegarLoop]: 1962 mSDtfsCounter, 782 mSDsluCounter, 3167 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 5129 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:01,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 5129 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:59:01,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3509 states. [2022-12-14 04:59:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3509 to 3507. [2022-12-14 04:59:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3507 states, 2666 states have (on average 1.9171042760690173) internal successors, (5111), 3482 states have internal predecessors, (5111), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 3507 states and 5161 transitions. [2022-12-14 04:59:01,149 INFO L78 Accepts]: Start accepts. Automaton has 3507 states and 5161 transitions. Word has length 13 [2022-12-14 04:59:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:01,149 INFO L495 AbstractCegarLoop]: Abstraction has 3507 states and 5161 transitions. [2022-12-14 04:59:01,149 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) [2022-12-14 04:59:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3507 states and 5161 transitions. [2022-12-14 04:59:01,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 04:59:01,150 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:01,150 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] [2022-12-14 04:59:01,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:01,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:01,352 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:01,353 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-12-14 04:59:01,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:01,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227096562] [2022-12-14 04:59:01,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:01,356 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 [2022-12-14 04:59:01,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:01,359 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:01,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:01,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 04:59:01,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:01,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:01,554 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:01,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227096562] [2022-12-14 04:59:01,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227096562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:01,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:01,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:59:01,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708192663] [2022-12-14 04:59:01,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:01,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:59:01,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:01,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:59:01,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:59:01,556 INFO L87 Difference]: Start difference. First operand 3507 states and 5161 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:59:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:01,595 INFO L93 Difference]: Finished difference Result 4755 states and 6516 transitions. [2022-12-14 04:59:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:59:01,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 04:59:01,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:01,601 INFO L225 Difference]: With dead ends: 4755 [2022-12-14 04:59:01,601 INFO L226 Difference]: Without dead ends: 4755 [2022-12-14 04:59:01,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:59:01,602 INFO L413 NwaCegarLoop]: 3293 mSDtfsCounter, 1888 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 4697 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:01,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 4697 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:59:01,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2022-12-14 04:59:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 3447. [2022-12-14 04:59:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 2630 states have (on average 1.9106463878326996) internal successors, (5025), 3422 states have internal predecessors, (5025), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 5075 transitions. [2022-12-14 04:59:01,642 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 5075 transitions. Word has length 20 [2022-12-14 04:59:01,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:01,642 INFO L495 AbstractCegarLoop]: Abstraction has 3447 states and 5075 transitions. [2022-12-14 04:59:01,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:59:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 5075 transitions. [2022-12-14 04:59:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 04:59:01,643 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:01,643 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] [2022-12-14 04:59:01,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:01,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:01,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash 413623007, now seen corresponding path program 1 times [2022-12-14 04:59:01,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:01,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644384847] [2022-12-14 04:59:01,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:01,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:01,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:01,848 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:01,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:01,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 04:59:02,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:02,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:02,009 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:02,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644384847] [2022-12-14 04:59:02,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644384847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:02,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:02,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:59:02,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496640147] [2022-12-14 04:59:02,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:02,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:59:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:02,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:59:02,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:59:02,015 INFO L87 Difference]: Start difference. First operand 3447 states and 5075 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:59:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:02,051 INFO L93 Difference]: Finished difference Result 4588 states and 6225 transitions. [2022-12-14 04:59:02,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:59:02,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 04:59:02,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:02,060 INFO L225 Difference]: With dead ends: 4588 [2022-12-14 04:59:02,060 INFO L226 Difference]: Without dead ends: 4588 [2022-12-14 04:59:02,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:59:02,061 INFO L413 NwaCegarLoop]: 3202 mSDtfsCounter, 1845 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 4558 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:02,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1855 Valid, 4558 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:59:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2022-12-14 04:59:02,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 3315. [2022-12-14 04:59:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3315 states, 2522 states have (on average 1.8901665344964313) internal successors, (4767), 3290 states have internal predecessors, (4767), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 4817 transitions. [2022-12-14 04:59:02,115 INFO L78 Accepts]: Start accepts. Automaton has 3315 states and 4817 transitions. Word has length 20 [2022-12-14 04:59:02,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:02,116 INFO L495 AbstractCegarLoop]: Abstraction has 3315 states and 4817 transitions. [2022-12-14 04:59:02,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:59:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 4817 transitions. [2022-12-14 04:59:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 04:59:02,117 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:02,117 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] [2022-12-14 04:59:02,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-14 04:59:02,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:02,319 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-12-14 04:59:02,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:02,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307830586] [2022-12-14 04:59:02,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:02,323 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 [2022-12-14 04:59:02,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:02,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:02,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:02,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:59:02,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:02,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:02,535 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:02,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307830586] [2022-12-14 04:59:02,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307830586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:02,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:02,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:59:02,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279267647] [2022-12-14 04:59:02,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:02,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:02,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:02,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:02,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:02,537 INFO L87 Difference]: Start difference. First operand 3315 states and 4817 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-12-14 04:59:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:02,616 INFO L93 Difference]: Finished difference Result 4553 states and 6159 transitions. [2022-12-14 04:59:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:59:02,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-12-14 04:59:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:02,622 INFO L225 Difference]: With dead ends: 4553 [2022-12-14 04:59:02,622 INFO L226 Difference]: Without dead ends: 4553 [2022-12-14 04:59:02,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:59:02,623 INFO L413 NwaCegarLoop]: 3162 mSDtfsCounter, 1826 mSDsluCounter, 4516 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1836 SdHoareTripleChecker+Valid, 7678 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:02,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1836 Valid, 7678 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:59:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2022-12-14 04:59:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 3285. [2022-12-14 04:59:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3285 states, 2506 states have (on average 1.8790901835594573) internal successors, (4709), 3260 states have internal predecessors, (4709), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 4759 transitions. [2022-12-14 04:59:02,652 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 4759 transitions. Word has length 22 [2022-12-14 04:59:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:02,652 INFO L495 AbstractCegarLoop]: Abstraction has 3285 states and 4759 transitions. [2022-12-14 04:59:02,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-12-14 04:59:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 4759 transitions. [2022-12-14 04:59:02,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 04:59:02,653 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:02,653 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] [2022-12-14 04:59:02,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:02,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:02,854 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr358REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:02,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1940223495, now seen corresponding path program 1 times [2022-12-14 04:59:02,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:02,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641274308] [2022-12-14 04:59:02,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:02,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 [2022-12-14 04:59:02,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:02,856 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:02,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:02,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:59:02,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:03,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:03,009 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:03,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641274308] [2022-12-14 04:59:03,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641274308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:03,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:03,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:59:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009180637] [2022-12-14 04:59:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:03,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:03,011 INFO L87 Difference]: Start difference. First operand 3285 states and 4759 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-12-14 04:59:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:03,095 INFO L93 Difference]: Finished difference Result 4480 states and 5970 transitions. [2022-12-14 04:59:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:59:03,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-12-14 04:59:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:03,102 INFO L225 Difference]: With dead ends: 4480 [2022-12-14 04:59:03,102 INFO L226 Difference]: Without dead ends: 4480 [2022-12-14 04:59:03,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:59:03,102 INFO L413 NwaCegarLoop]: 3087 mSDtfsCounter, 1791 mSDsluCounter, 4401 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 7488 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:03,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 7488 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:59:03,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4480 states. [2022-12-14 04:59:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4480 to 3223. [2022-12-14 04:59:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 2458 states have (on average 1.8449959316517495) internal successors, (4535), 3198 states have internal predecessors, (4535), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4585 transitions. [2022-12-14 04:59:03,134 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4585 transitions. Word has length 22 [2022-12-14 04:59:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:03,134 INFO L495 AbstractCegarLoop]: Abstraction has 3223 states and 4585 transitions. [2022-12-14 04:59:03,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-12-14 04:59:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4585 transitions. [2022-12-14 04:59:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 04:59:03,135 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:03,135 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] [2022-12-14 04:59:03,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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)] Forceful destruction successful, exit code 0 [2022-12-14 04:59:03,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:03,335 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:03,336 INFO L85 PathProgramCache]: Analyzing trace with hash 558613821, now seen corresponding path program 1 times [2022-12-14 04:59:03,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:03,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715077333] [2022-12-14 04:59:03,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:03,336 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 [2022-12-14 04:59:03,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:03,337 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:03,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:03,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 04:59:03,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:03,446 INFO L350 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 [2022-12-14 04:59:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:03,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:03,498 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:03,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715077333] [2022-12-14 04:59:03,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715077333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:03,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:03,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:59:03,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056781029] [2022-12-14 04:59:03,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:03,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:03,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:03,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:03,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:03,500 INFO L87 Difference]: Start difference. First operand 3223 states and 4585 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) [2022-12-14 04:59:06,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:06,249 INFO L93 Difference]: Finished difference Result 3497 states and 4756 transitions. [2022-12-14 04:59:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:59:06,250 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 [2022-12-14 04:59:06,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:06,255 INFO L225 Difference]: With dead ends: 3497 [2022-12-14 04:59:06,255 INFO L226 Difference]: Without dead ends: 3497 [2022-12-14 04:59:06,255 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 [2022-12-14 04:59:06,256 INFO L413 NwaCegarLoop]: 1119 mSDtfsCounter, 2359 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2365 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:06,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2365 Valid, 2007 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-12-14 04:59:06,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2022-12-14 04:59:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 3219. [2022-12-14 04:59:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2458 states have (on average 1.8417412530512611) internal successors, (4527), 3194 states have internal predecessors, (4527), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4577 transitions. [2022-12-14 04:59:06,298 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4577 transitions. Word has length 27 [2022-12-14 04:59:06,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:06,298 INFO L495 AbstractCegarLoop]: Abstraction has 3219 states and 4577 transitions. [2022-12-14 04:59:06,298 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) [2022-12-14 04:59:06,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4577 transitions. [2022-12-14 04:59:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 04:59:06,299 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:06,299 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] [2022-12-14 04:59:06,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:06,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:06,500 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:06,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:06,500 INFO L85 PathProgramCache]: Analyzing trace with hash 558613822, now seen corresponding path program 1 times [2022-12-14 04:59:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:06,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565423194] [2022-12-14 04:59:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:06,501 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 [2022-12-14 04:59:06,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:06,502 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:06,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:06,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 04:59:06,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:06,618 INFO L350 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 [2022-12-14 04:59:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:06,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:06,734 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:06,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565423194] [2022-12-14 04:59:06,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565423194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:06,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:06,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:59:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142652245] [2022-12-14 04:59:06,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:06,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:06,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:06,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:06,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:06,736 INFO L87 Difference]: Start difference. First operand 3219 states and 4577 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) [2022-12-14 04:59:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:11,527 INFO L93 Difference]: Finished difference Result 3921 states and 5351 transitions. [2022-12-14 04:59:11,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 04:59:11,528 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 [2022-12-14 04:59:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:11,535 INFO L225 Difference]: With dead ends: 3921 [2022-12-14 04:59:11,535 INFO L226 Difference]: Without dead ends: 3921 [2022-12-14 04:59:11,535 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 [2022-12-14 04:59:11,536 INFO L413 NwaCegarLoop]: 1536 mSDtfsCounter, 1488 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:11,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 3463 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-12-14 04:59:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2022-12-14 04:59:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 3255. [2022-12-14 04:59:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3255 states, 2494 states have (on average 1.8315958299919808) internal successors, (4568), 3230 states have internal predecessors, (4568), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4618 transitions. [2022-12-14 04:59:11,577 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4618 transitions. Word has length 27 [2022-12-14 04:59:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:11,577 INFO L495 AbstractCegarLoop]: Abstraction has 3255 states and 4618 transitions. [2022-12-14 04:59:11,578 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) [2022-12-14 04:59:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4618 transitions. [2022-12-14 04:59:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 04:59:11,578 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:11,578 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] [2022-12-14 04:59:11,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:11,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:11,779 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:11,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-12-14 04:59:11,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:11,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322766487] [2022-12-14 04:59:11,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:11,780 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 [2022-12-14 04:59:11,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:11,781 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:11,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:11,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 04:59:11,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:11,940 INFO L350 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 [2022-12-14 04:59:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:11,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:11,989 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:11,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322766487] [2022-12-14 04:59:11,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322766487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:11,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:11,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:59:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274892217] [2022-12-14 04:59:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:11,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:11,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:11,991 INFO L87 Difference]: Start difference. First operand 3255 states and 4618 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-12-14 04:59:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:16,125 INFO L93 Difference]: Finished difference Result 6298 states and 8778 transitions. [2022-12-14 04:59:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:59:16,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-12-14 04:59:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:16,131 INFO L225 Difference]: With dead ends: 6298 [2022-12-14 04:59:16,131 INFO L226 Difference]: Without dead ends: 6298 [2022-12-14 04:59:16,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:59:16,131 INFO L413 NwaCegarLoop]: 2131 mSDtfsCounter, 3914 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3921 SdHoareTripleChecker+Valid, 3965 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:16,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3921 Valid, 3965 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-12-14 04:59:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6298 states. [2022-12-14 04:59:16,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6298 to 3251. [2022-12-14 04:59:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3251 states, 2494 states have (on average 1.8283881315156376) internal successors, (4560), 3226 states have internal predecessors, (4560), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 4610 transitions. [2022-12-14 04:59:16,164 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 4610 transitions. Word has length 36 [2022-12-14 04:59:16,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:16,164 INFO L495 AbstractCegarLoop]: Abstraction has 3251 states and 4610 transitions. [2022-12-14 04:59:16,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-12-14 04:59:16,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 4610 transitions. [2022-12-14 04:59:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 04:59:16,165 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:16,165 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] [2022-12-14 04:59:16,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-12-14 04:59:16,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:16,366 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:16,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:16,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-12-14 04:59:16,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:16,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300964744] [2022-12-14 04:59:16,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:16,367 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 [2022-12-14 04:59:16,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:16,368 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:16,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:16,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 04:59:16,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:16,531 INFO L350 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 [2022-12-14 04:59:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:16,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:16,667 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:16,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300964744] [2022-12-14 04:59:16,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300964744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:16,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:16,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:59:16,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547300712] [2022-12-14 04:59:16,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:16,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:16,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:16,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:16,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:16,669 INFO L87 Difference]: Start difference. First operand 3251 states and 4610 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-12-14 04:59:23,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:23,648 INFO L93 Difference]: Finished difference Result 5969 states and 8158 transitions. [2022-12-14 04:59:23,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:59:23,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-12-14 04:59:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:23,653 INFO L225 Difference]: With dead ends: 5969 [2022-12-14 04:59:23,653 INFO L226 Difference]: Without dead ends: 5969 [2022-12-14 04:59:23,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:59:23,654 INFO L413 NwaCegarLoop]: 2587 mSDtfsCounter, 2437 mSDsluCounter, 2285 mSDsCounter, 0 mSdLazyCounter, 2709 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2441 SdHoareTripleChecker+Valid, 4872 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:23,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2441 Valid, 4872 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2709 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-12-14 04:59:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2022-12-14 04:59:23,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3247. [2022-12-14 04:59:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3247 states, 2494 states have (on average 1.8251804330392942) internal successors, (4552), 3222 states have internal predecessors, (4552), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 4602 transitions. [2022-12-14 04:59:23,687 INFO L78 Accepts]: Start accepts. Automaton has 3247 states and 4602 transitions. Word has length 36 [2022-12-14 04:59:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:23,688 INFO L495 AbstractCegarLoop]: Abstraction has 3247 states and 4602 transitions. [2022-12-14 04:59:23,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-12-14 04:59:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 4602 transitions. [2022-12-14 04:59:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 04:59:23,688 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:23,688 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] [2022-12-14 04:59:23,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:23,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:23,889 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash -775407193, now seen corresponding path program 1 times [2022-12-14 04:59:23,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:23,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880876669] [2022-12-14 04:59:23,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:23,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:23,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:23,891 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:23,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-12-14 04:59:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:24,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 04:59:24,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:24,045 INFO L350 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 [2022-12-14 04:59:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:24,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:24,102 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:24,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880876669] [2022-12-14 04:59:24,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880876669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:24,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:24,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:59:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946416730] [2022-12-14 04:59:24,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:24,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:24,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:24,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:24,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:24,104 INFO L87 Difference]: Start difference. First operand 3247 states and 4602 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-12-14 04:59:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:29,387 INFO L93 Difference]: Finished difference Result 6741 states and 9288 transitions. [2022-12-14 04:59:29,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 04:59:29,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-12-14 04:59:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:29,392 INFO L225 Difference]: With dead ends: 6741 [2022-12-14 04:59:29,393 INFO L226 Difference]: Without dead ends: 6741 [2022-12-14 04:59:29,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:59:29,393 INFO L413 NwaCegarLoop]: 1959 mSDtfsCounter, 4484 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4494 SdHoareTripleChecker+Valid, 3980 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:29,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4494 Valid, 3980 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-12-14 04:59:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6741 states. [2022-12-14 04:59:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6741 to 3244. [2022-12-14 04:59:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3244 states, 2494 states have (on average 1.8163592622293505) internal successors, (4530), 3219 states have internal predecessors, (4530), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4580 transitions. [2022-12-14 04:59:29,426 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4580 transitions. Word has length 36 [2022-12-14 04:59:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:29,427 INFO L495 AbstractCegarLoop]: Abstraction has 3244 states and 4580 transitions. [2022-12-14 04:59:29,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-12-14 04:59:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4580 transitions. [2022-12-14 04:59:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 04:59:29,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:29,427 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] [2022-12-14 04:59:29,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-12-14 04:59:29,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:29,628 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:29,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash -775407192, now seen corresponding path program 1 times [2022-12-14 04:59:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:29,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503838826] [2022-12-14 04:59:29,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:29,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 [2022-12-14 04:59:29,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:29,629 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:29,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-12-14 04:59:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:29,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 04:59:29,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:29,787 INFO L350 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 [2022-12-14 04:59:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:29,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:29,913 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:29,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503838826] [2022-12-14 04:59:29,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503838826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:29,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:29,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:59:29,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052368894] [2022-12-14 04:59:29,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:29,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:29,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:29,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:29,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:29,915 INFO L87 Difference]: Start difference. First operand 3244 states and 4580 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-12-14 04:59:35,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:35,432 INFO L93 Difference]: Finished difference Result 4803 states and 6543 transitions. [2022-12-14 04:59:35,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:59:35,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-12-14 04:59:35,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:35,437 INFO L225 Difference]: With dead ends: 4803 [2022-12-14 04:59:35,437 INFO L226 Difference]: Without dead ends: 4803 [2022-12-14 04:59:35,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:59:35,438 INFO L413 NwaCegarLoop]: 2234 mSDtfsCounter, 2208 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 4091 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:35,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 4091 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-12-14 04:59:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2022-12-14 04:59:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 3244. [2022-12-14 04:59:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3244 states, 2494 states have (on average 1.8131515637530071) internal successors, (4522), 3219 states have internal predecessors, (4522), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4572 transitions. [2022-12-14 04:59:35,467 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4572 transitions. Word has length 36 [2022-12-14 04:59:35,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:35,467 INFO L495 AbstractCegarLoop]: Abstraction has 3244 states and 4572 transitions. [2022-12-14 04:59:35,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2022-12-14 04:59:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4572 transitions. [2022-12-14 04:59:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 04:59:35,467 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:35,468 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] [2022-12-14 04:59:35,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-12-14 04:59:35,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:35,669 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:35,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash -715750141, now seen corresponding path program 1 times [2022-12-14 04:59:35,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:35,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091349231] [2022-12-14 04:59:35,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:35,673 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 [2022-12-14 04:59:35,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:35,676 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:35,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:35,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:59:35,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:35,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:35,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:35,872 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:35,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091349231] [2022-12-14 04:59:35,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091349231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:35,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:35,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:59:35,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824797557] [2022-12-14 04:59:35,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:35,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:35,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:35,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:35,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:35,873 INFO L87 Difference]: Start difference. First operand 3244 states and 4572 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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) [2022-12-14 04:59:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:35,917 INFO L93 Difference]: Finished difference Result 3232 states and 4548 transitions. [2022-12-14 04:59:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:59:35,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2022-12-14 04:59:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:35,920 INFO L225 Difference]: With dead ends: 3232 [2022-12-14 04:59:35,920 INFO L226 Difference]: Without dead ends: 3232 [2022-12-14 04:59:35,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:59:35,921 INFO L413 NwaCegarLoop]: 1793 mSDtfsCounter, 759 mSDsluCounter, 2817 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 4610 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:35,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 4610 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:59:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2022-12-14 04:59:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 3232. [2022-12-14 04:59:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3232 states, 2482 states have (on average 1.8122481869460112) internal successors, (4498), 3207 states have internal predecessors, (4498), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 04:59:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4548 transitions. [2022-12-14 04:59:35,949 INFO L78 Accepts]: Start accepts. Automaton has 3232 states and 4548 transitions. Word has length 40 [2022-12-14 04:59:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:35,950 INFO L495 AbstractCegarLoop]: Abstraction has 3232 states and 4548 transitions. [2022-12-14 04:59:35,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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) [2022-12-14 04:59:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4548 transitions. [2022-12-14 04:59:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 04:59:35,950 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:35,950 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] [2022-12-14 04:59:35,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:36,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:36,151 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:36,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:36,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1005839671, now seen corresponding path program 1 times [2022-12-14 04:59:36,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:36,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947211069] [2022-12-14 04:59:36,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:36,152 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 [2022-12-14 04:59:36,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:36,153 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:36,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-12-14 04:59:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:36,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:59:36,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:36,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:36,454 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:36,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947211069] [2022-12-14 04:59:36,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947211069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:36,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:36,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:59:36,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803836625] [2022-12-14 04:59:36,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:36,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:59:36,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:36,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:59:36,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:59:36,455 INFO L87 Difference]: Start difference. First operand 3232 states and 4548 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2022-12-14 04:59:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:36,621 INFO L93 Difference]: Finished difference Result 4679 states and 6365 transitions. [2022-12-14 04:59:36,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:59:36,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2022-12-14 04:59:36,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:36,626 INFO L225 Difference]: With dead ends: 4679 [2022-12-14 04:59:36,626 INFO L226 Difference]: Without dead ends: 4679 [2022-12-14 04:59:36,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:59:36,627 INFO L413 NwaCegarLoop]: 1813 mSDtfsCounter, 1178 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 3491 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:36,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 3491 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:59:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2022-12-14 04:59:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 4015. [2022-12-14 04:59:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4015 states, 3261 states have (on average 1.7985280588776449) internal successors, (5865), 3983 states have internal predecessors, (5865), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-14 04:59:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4015 states to 4015 states and 5929 transitions. [2022-12-14 04:59:36,663 INFO L78 Accepts]: Start accepts. Automaton has 4015 states and 5929 transitions. Word has length 48 [2022-12-14 04:59:36,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:36,663 INFO L495 AbstractCegarLoop]: Abstraction has 4015 states and 5929 transitions. [2022-12-14 04:59:36,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2022-12-14 04:59:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 5929 transitions. [2022-12-14 04:59:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 04:59:36,664 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:36,664 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] [2022-12-14 04:59:36,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-12-14 04:59:36,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:36,864 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:36,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:36,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1815084135, now seen corresponding path program 1 times [2022-12-14 04:59:36,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:36,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217418536] [2022-12-14 04:59:36,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:36,866 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 [2022-12-14 04:59:36,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:36,866 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:36,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-12-14 04:59:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:37,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:59:37,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:37,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:37,097 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:37,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217418536] [2022-12-14 04:59:37,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217418536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:37,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:37,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:59:37,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017954825] [2022-12-14 04:59:37,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:37,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:37,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:37,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:37,099 INFO L87 Difference]: Start difference. First operand 4015 states and 5929 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2022-12-14 04:59:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:37,151 INFO L93 Difference]: Finished difference Result 4953 states and 6910 transitions. [2022-12-14 04:59:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:59:37,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2022-12-14 04:59:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:37,156 INFO L225 Difference]: With dead ends: 4953 [2022-12-14 04:59:37,156 INFO L226 Difference]: Without dead ends: 4953 [2022-12-14 04:59:37,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:59:37,156 INFO L413 NwaCegarLoop]: 2861 mSDtfsCounter, 1754 mSDsluCounter, 3951 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 6812 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:37,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1764 Valid, 6812 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:59:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4953 states. [2022-12-14 04:59:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4953 to 3973. [2022-12-14 04:59:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3973 states, 3219 states have (on average 1.8002485243864554) internal successors, (5795), 3941 states have internal predecessors, (5795), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-14 04:59:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 5859 transitions. [2022-12-14 04:59:37,192 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 5859 transitions. Word has length 51 [2022-12-14 04:59:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:37,192 INFO L495 AbstractCegarLoop]: Abstraction has 3973 states and 5859 transitions. [2022-12-14 04:59:37,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2022-12-14 04:59:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 5859 transitions. [2022-12-14 04:59:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 04:59:37,193 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:37,193 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] [2022-12-14 04:59:37,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-12-14 04:59:37,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:37,394 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:37,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-12-14 04:59:37,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:37,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31758568] [2022-12-14 04:59:37,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:37,398 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 [2022-12-14 04:59:37,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:37,401 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:37,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:37,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:59:37,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:37,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:37,826 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:37,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31758568] [2022-12-14 04:59:37,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31758568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:37,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:37,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:59:37,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081182324] [2022-12-14 04:59:37,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:37,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:37,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:37,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:37,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:37,828 INFO L87 Difference]: Start difference. First operand 3973 states and 5859 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:59:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:37,884 INFO L93 Difference]: Finished difference Result 4690 states and 6398 transitions. [2022-12-14 04:59:37,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:59:37,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-12-14 04:59:37,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:37,888 INFO L225 Difference]: With dead ends: 4690 [2022-12-14 04:59:37,888 INFO L226 Difference]: Without dead ends: 4690 [2022-12-14 04:59:37,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:59:37,889 INFO L413 NwaCegarLoop]: 2901 mSDtfsCounter, 1745 mSDsluCounter, 4040 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 6941 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:37,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 6941 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:59:37,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4690 states. [2022-12-14 04:59:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4690 to 3955. [2022-12-14 04:59:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3955 states, 3201 states have (on average 1.8009996875976257) internal successors, (5765), 3923 states have internal predecessors, (5765), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-14 04:59:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 5829 transitions. [2022-12-14 04:59:37,920 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 5829 transitions. Word has length 54 [2022-12-14 04:59:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:37,920 INFO L495 AbstractCegarLoop]: Abstraction has 3955 states and 5829 transitions. [2022-12-14 04:59:37,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:59:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 5829 transitions. [2022-12-14 04:59:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 04:59:37,921 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:37,921 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] [2022-12-14 04:59:37,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-12-14 04:59:38,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:38,122 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:38,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:38,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1488707999, now seen corresponding path program 1 times [2022-12-14 04:59:38,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:38,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902611754] [2022-12-14 04:59:38,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:38,126 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 [2022-12-14 04:59:38,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:38,129 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:38,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-12-14 04:59:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:38,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 04:59:38,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:38,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:59:38,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:59:38,356 INFO L350 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 29 treesize of output 38 [2022-12-14 04:59:38,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:38,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2022-12-14 04:59:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:38,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:38,414 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:38,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902611754] [2022-12-14 04:59:38,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902611754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:38,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:38,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:59:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913380087] [2022-12-14 04:59:38,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:38,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:38,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:38,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:38,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:38,415 INFO L87 Difference]: Start difference. First operand 3955 states and 5829 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:59:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:40,215 INFO L93 Difference]: Finished difference Result 3924 states and 5797 transitions. [2022-12-14 04:59:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:59:40,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-12-14 04:59:40,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:40,219 INFO L225 Difference]: With dead ends: 3924 [2022-12-14 04:59:40,219 INFO L226 Difference]: Without dead ends: 3924 [2022-12-14 04:59:40,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:59:40,220 INFO L413 NwaCegarLoop]: 1689 mSDtfsCounter, 762 mSDsluCounter, 2555 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 4244 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:40,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 4244 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 04:59:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2022-12-14 04:59:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 3921. [2022-12-14 04:59:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3167 states have (on average 1.8092832333438584) internal successors, (5730), 3889 states have internal predecessors, (5730), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-14 04:59:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 5794 transitions. [2022-12-14 04:59:40,250 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 5794 transitions. Word has length 57 [2022-12-14 04:59:40,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:40,250 INFO L495 AbstractCegarLoop]: Abstraction has 3921 states and 5794 transitions. [2022-12-14 04:59:40,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:59:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 5794 transitions. [2022-12-14 04:59:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-14 04:59:40,250 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:40,251 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] [2022-12-14 04:59:40,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-12-14 04:59:40,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:40,452 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:40,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:40,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2076762779, now seen corresponding path program 1 times [2022-12-14 04:59:40,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:40,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21205267] [2022-12-14 04:59:40,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:40,454 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 [2022-12-14 04:59:40,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:40,455 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:40,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-12-14 04:59:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:40,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:59:40,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:41,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:41,035 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:41,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21205267] [2022-12-14 04:59:41,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21205267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:41,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:41,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:59:41,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846554987] [2022-12-14 04:59:41,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:41,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:59:41,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:41,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:59:41,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:59:41,036 INFO L87 Difference]: Start difference. First operand 3921 states and 5794 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2022-12-14 04:59:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:41,200 INFO L93 Difference]: Finished difference Result 5180 states and 7386 transitions. [2022-12-14 04:59:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:59:41,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2022-12-14 04:59:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:41,206 INFO L225 Difference]: With dead ends: 5180 [2022-12-14 04:59:41,206 INFO L226 Difference]: Without dead ends: 5180 [2022-12-14 04:59:41,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:59:41,207 INFO L413 NwaCegarLoop]: 1807 mSDtfsCounter, 868 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 3475 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:41,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 3475 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:59:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5180 states. [2022-12-14 04:59:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5180 to 4837. [2022-12-14 04:59:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4837 states, 4077 states have (on average 1.7888153053715967) internal successors, (7293), 4796 states have internal predecessors, (7293), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-14 04:59:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4837 states to 4837 states and 7375 transitions. [2022-12-14 04:59:41,248 INFO L78 Accepts]: Start accepts. Automaton has 4837 states and 7375 transitions. Word has length 59 [2022-12-14 04:59:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:41,248 INFO L495 AbstractCegarLoop]: Abstraction has 4837 states and 7375 transitions. [2022-12-14 04:59:41,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2022-12-14 04:59:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4837 states and 7375 transitions. [2022-12-14 04:59:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 04:59:41,249 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:41,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:59:41,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-12-14 04:59:41,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:41,450 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:41,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:41,450 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-12-14 04:59:41,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:41,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838923050] [2022-12-14 04:59:41,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:41,452 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 [2022-12-14 04:59:41,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:41,454 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:41,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:41,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 04:59:41,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:41,889 INFO L350 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 [2022-12-14 04:59:41,893 INFO L350 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 [2022-12-14 04:59:42,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:42,222 INFO L350 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 12 treesize of output 14 [2022-12-14 04:59:42,232 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 04:59:42,232 INFO L350 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 [2022-12-14 04:59:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:42,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:42,242 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:42,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838923050] [2022-12-14 04:59:42,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838923050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:42,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:42,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:59:42,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892007340] [2022-12-14 04:59:42,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:42,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:59:42,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:42,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:59:42,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:42,244 INFO L87 Difference]: Start difference. First operand 4837 states and 7375 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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) [2022-12-14 04:59:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:46,615 INFO L93 Difference]: Finished difference Result 6868 states and 10388 transitions. [2022-12-14 04:59:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:59:46,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-12-14 04:59:46,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:46,621 INFO L225 Difference]: With dead ends: 6868 [2022-12-14 04:59:46,621 INFO L226 Difference]: Without dead ends: 6868 [2022-12-14 04:59:46,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:59:46,621 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 2422 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2436 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:46,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2436 Valid, 1071 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-12-14 04:59:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2022-12-14 04:59:46,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 4597. [2022-12-14 04:59:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4597 states, 3921 states have (on average 1.7118082121907676) internal successors, (6712), 4556 states have internal predecessors, (6712), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-14 04:59:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4597 states to 4597 states and 6794 transitions. [2022-12-14 04:59:46,662 INFO L78 Accepts]: Start accepts. Automaton has 4597 states and 6794 transitions. Word has length 62 [2022-12-14 04:59:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:46,662 INFO L495 AbstractCegarLoop]: Abstraction has 4597 states and 6794 transitions. [2022-12-14 04:59:46,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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) [2022-12-14 04:59:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4597 states and 6794 transitions. [2022-12-14 04:59:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 04:59:46,662 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:46,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:59:46,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-12-14 04:59:46,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:46,864 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:46,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-12-14 04:59:46,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:46,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932251155] [2022-12-14 04:59:46,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:46,868 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 [2022-12-14 04:59:46,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:46,871 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:46,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-12-14 04:59:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:47,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 04:59:47,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:47,152 INFO L350 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 [2022-12-14 04:59:47,161 INFO L350 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 [2022-12-14 04:59:47,179 INFO L350 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 [2022-12-14 04:59:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:47,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:47,187 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:47,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932251155] [2022-12-14 04:59:47,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932251155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:47,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:47,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:59:47,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494871353] [2022-12-14 04:59:47,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:47,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:59:47,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:47,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:59:47,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:59:47,189 INFO L87 Difference]: Start difference. First operand 4597 states and 6794 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-12-14 04:59:50,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:50,811 INFO L93 Difference]: Finished difference Result 4596 states and 6791 transitions. [2022-12-14 04:59:50,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:59:50,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-12-14 04:59:50,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:50,815 INFO L225 Difference]: With dead ends: 4596 [2022-12-14 04:59:50,815 INFO L226 Difference]: Without dead ends: 4596 [2022-12-14 04:59:50,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:59:50,816 INFO L413 NwaCegarLoop]: 1712 mSDtfsCounter, 4 mSDsluCounter, 2861 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:50,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4573 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-12-14 04:59:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4596 states. [2022-12-14 04:59:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4596 to 4596. [2022-12-14 04:59:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4596 states, 3921 states have (on average 1.7110431012496812) internal successors, (6709), 4555 states have internal predecessors, (6709), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-14 04:59:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 6791 transitions. [2022-12-14 04:59:50,848 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 6791 transitions. Word has length 67 [2022-12-14 04:59:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:50,848 INFO L495 AbstractCegarLoop]: Abstraction has 4596 states and 6791 transitions. [2022-12-14 04:59:50,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-12-14 04:59:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 6791 transitions. [2022-12-14 04:59:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 04:59:50,849 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:50,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:59:50,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-12-14 04:59:51,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:51,050 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-12-14 04:59:51,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:51,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439225865] [2022-12-14 04:59:51,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:51,054 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 [2022-12-14 04:59:51,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:51,057 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:51,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-12-14 04:59:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:51,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 04:59:51,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:51,311 INFO L350 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 [2022-12-14 04:59:51,322 INFO L350 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 [2022-12-14 04:59:51,328 INFO L350 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 [2022-12-14 04:59:51,364 INFO L350 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 [2022-12-14 04:59:51,369 INFO L350 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 19 treesize of output 7 [2022-12-14 04:59:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:51,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:51,379 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:51,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439225865] [2022-12-14 04:59:51,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439225865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:51,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:51,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:59:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664527497] [2022-12-14 04:59:51,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:51,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:59:51,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:51,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:59:51,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:59:51,381 INFO L87 Difference]: Start difference. First operand 4596 states and 6791 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-12-14 04:59:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:56,501 INFO L93 Difference]: Finished difference Result 4595 states and 6788 transitions. [2022-12-14 04:59:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:59:56,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-12-14 04:59:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:56,505 INFO L225 Difference]: With dead ends: 4595 [2022-12-14 04:59:56,505 INFO L226 Difference]: Without dead ends: 4595 [2022-12-14 04:59:56,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:59:56,506 INFO L413 NwaCegarLoop]: 1712 mSDtfsCounter, 2 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4546 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:56,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4546 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-12-14 04:59:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2022-12-14 04:59:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4595. [2022-12-14 04:59:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4595 states, 3918 states have (on average 1.7115875446656457) internal successors, (6706), 4554 states have internal predecessors, (6706), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-14 04:59:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 6788 transitions. [2022-12-14 04:59:56,541 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 6788 transitions. Word has length 67 [2022-12-14 04:59:56,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:56,541 INFO L495 AbstractCegarLoop]: Abstraction has 4595 states and 6788 transitions. [2022-12-14 04:59:56,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-12-14 04:59:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 6788 transitions. [2022-12-14 04:59:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 04:59:56,546 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:56,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:59:56,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-12-14 04:59:56,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:59:56,747 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 04:59:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:56,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017746, now seen corresponding path program 1 times [2022-12-14 04:59:56,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:59:56,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674943123] [2022-12-14 04:59:56,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:56,751 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 [2022-12-14 04:59:56,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:59:56,754 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 04:59:56,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 04:59:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:57,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 04:59:57,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:57,044 INFO L350 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 [2022-12-14 04:59:57,054 INFO L350 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 [2022-12-14 04:59:57,080 INFO L350 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 [2022-12-14 04:59:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:59:57,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:59:57,088 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:59:57,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674943123] [2022-12-14 04:59:57,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674943123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:59:57,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:59:57,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:59:57,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435208766] [2022-12-14 04:59:57,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:59:57,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:59:57,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:59:57,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:59:57,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:59:57,090 INFO L87 Difference]: Start difference. First operand 4595 states and 6788 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-12-14 05:00:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:00:00,794 INFO L93 Difference]: Finished difference Result 4594 states and 6784 transitions. [2022-12-14 05:00:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 05:00:00,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-12-14 05:00:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:00:00,798 INFO L225 Difference]: With dead ends: 4594 [2022-12-14 05:00:00,798 INFO L226 Difference]: Without dead ends: 4594 [2022-12-14 05:00:00,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:00:00,799 INFO L413 NwaCegarLoop]: 1710 mSDtfsCounter, 4 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4568 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:00:00,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4568 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-12-14 05:00:00,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2022-12-14 05:00:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 4594. [2022-12-14 05:00:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4594 states, 3918 states have (on average 1.7105666156202144) internal successors, (6702), 4553 states have internal predecessors, (6702), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-14 05:00:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 6784 transitions. [2022-12-14 05:00:00,831 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 6784 transitions. Word has length 67 [2022-12-14 05:00:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:00:00,831 INFO L495 AbstractCegarLoop]: Abstraction has 4594 states and 6784 transitions. [2022-12-14 05:00:00,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-12-14 05:00:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 6784 transitions. [2022-12-14 05:00:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 05:00:00,832 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:00:00,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:00:00,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 05:00:01,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 05:00:01,033 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 05:00:01,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:00:01,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017745, now seen corresponding path program 1 times [2022-12-14 05:00:01,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 05:00:01,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040369489] [2022-12-14 05:00:01,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:01,037 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 [2022-12-14 05:00:01,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 05:00:01,040 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 05:00:01,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-12-14 05:00:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:01,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 05:00:01,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:00:01,649 INFO L350 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 [2022-12-14 05:00:01,664 INFO L350 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 [2022-12-14 05:00:01,671 INFO L350 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 [2022-12-14 05:00:01,711 INFO L350 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 19 treesize of output 7 [2022-12-14 05:00:01,716 INFO L350 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 [2022-12-14 05:00:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:00:01,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:00:01,729 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 05:00:01,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040369489] [2022-12-14 05:00:01,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040369489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:00:01,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:00:01,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:00:01,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382641850] [2022-12-14 05:00:01,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:00:01,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:00:01,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 05:00:01,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:00:01,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:00:01,731 INFO L87 Difference]: Start difference. First operand 4594 states and 6784 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-12-14 05:00:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:00:06,925 INFO L93 Difference]: Finished difference Result 4593 states and 6780 transitions. [2022-12-14 05:00:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 05:00:06,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-12-14 05:00:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:00:06,930 INFO L225 Difference]: With dead ends: 4593 [2022-12-14 05:00:06,930 INFO L226 Difference]: Without dead ends: 4593 [2022-12-14 05:00:06,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:00:06,930 INFO L413 NwaCegarLoop]: 1710 mSDtfsCounter, 2 mSDsluCounter, 2831 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4541 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:00:06,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4541 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-12-14 05:00:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-12-14 05:00:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4593. [2022-12-14 05:00:06,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 3914 states have (on average 1.7112927950945325) internal successors, (6698), 4552 states have internal predecessors, (6698), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-12-14 05:00:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 6780 transitions. [2022-12-14 05:00:06,969 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 6780 transitions. Word has length 67 [2022-12-14 05:00:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:00:06,969 INFO L495 AbstractCegarLoop]: Abstraction has 4593 states and 6780 transitions. [2022-12-14 05:00:06,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-12-14 05:00:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 6780 transitions. [2022-12-14 05:00:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 05:00:06,970 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:00:06,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:00:06,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-12-14 05:00:07,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 05:00:07,171 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 05:00:07,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:00:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2018345425, now seen corresponding path program 1 times [2022-12-14 05:00:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 05:00:07,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092170598] [2022-12-14 05:00:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:07,173 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 [2022-12-14 05:00:07,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 05:00:07,174 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 05:00:07,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-12-14 05:00:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:07,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 05:00:07,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:00:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:00:07,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:00:07,451 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 05:00:07,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092170598] [2022-12-14 05:00:07,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092170598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:00:07,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:00:07,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:00:07,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487772025] [2022-12-14 05:00:07,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:00:07,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:00:07,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 05:00:07,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:00:07,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:00:07,453 INFO L87 Difference]: Start difference. First operand 4593 states and 6780 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2022-12-14 05:00:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:00:07,529 INFO L93 Difference]: Finished difference Result 4596 states and 6789 transitions. [2022-12-14 05:00:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:00:07,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2022-12-14 05:00:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:00:07,540 INFO L225 Difference]: With dead ends: 4596 [2022-12-14 05:00:07,540 INFO L226 Difference]: Without dead ends: 4596 [2022-12-14 05:00:07,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:00:07,541 INFO L413 NwaCegarLoop]: 1709 mSDtfsCounter, 2 mSDsluCounter, 3410 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5119 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:00:07,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5119 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:00:07,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4596 states. [2022-12-14 05:00:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4596 to 4596. [2022-12-14 05:00:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4596 states, 3916 states have (on average 1.7111848825331972) internal successors, (6701), 4555 states have internal predecessors, (6701), 41 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-12-14 05:00:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 6789 transitions. [2022-12-14 05:00:07,606 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 6789 transitions. Word has length 75 [2022-12-14 05:00:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:00:07,606 INFO L495 AbstractCegarLoop]: Abstraction has 4596 states and 6789 transitions. [2022-12-14 05:00:07,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2022-12-14 05:00:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 6789 transitions. [2022-12-14 05:00:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 05:00:07,608 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:00:07,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:00:07,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-12-14 05:00:07,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 05:00:07,809 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 05:00:07,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:00:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1265252366, now seen corresponding path program 1 times [2022-12-14 05:00:07,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 05:00:07,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749506591] [2022-12-14 05:00:07,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:07,813 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 [2022-12-14 05:00:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 05:00:07,816 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 05:00:07,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 05:00:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:08,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:00:08,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:00:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:00:08,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:00:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:00:08,181 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 05:00:08,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749506591] [2022-12-14 05:00:08,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749506591] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:00:08,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [892868663] [2022-12-14 05:00:08,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:08,182 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 05:00:08,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 05:00:08,183 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 05:00:08,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-12-14 05:00:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:08,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:00:08,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:00:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:00:08,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:00:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:00:08,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [892868663] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:00:08,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650864493] [2022-12-14 05:00:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:08,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:00:08,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:00:08,704 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:00:08,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 05:00:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:08,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:00:08,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:00:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:00:08,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:00:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:00:08,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650864493] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:00:08,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 05:00:08,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-12-14 05:00:08,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280947467] [2022-12-14 05:00:08,972 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 05:00:08,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 05:00:08,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 05:00:08,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 05:00:08,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:00:08,973 INFO L87 Difference]: Start difference. First operand 4596 states and 6789 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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) [2022-12-14 05:00:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:00:09,142 INFO L93 Difference]: Finished difference Result 4608 states and 6811 transitions. [2022-12-14 05:00:09,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 05:00:09,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 76 [2022-12-14 05:00:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:00:09,150 INFO L225 Difference]: With dead ends: 4608 [2022-12-14 05:00:09,150 INFO L226 Difference]: Without dead ends: 4608 [2022-12-14 05:00:09,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-12-14 05:00:09,151 INFO L413 NwaCegarLoop]: 1709 mSDtfsCounter, 9 mSDsluCounter, 5110 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6819 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:00:09,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6819 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:00:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2022-12-14 05:00:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 4606. [2022-12-14 05:00:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4606 states, 3925 states have (on average 1.7110828025477707) internal successors, (6716), 4564 states have internal predecessors, (6716), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-12-14 05:00:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4606 states to 4606 states and 6804 transitions. [2022-12-14 05:00:09,196 INFO L78 Accepts]: Start accepts. Automaton has 4606 states and 6804 transitions. Word has length 76 [2022-12-14 05:00:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:00:09,197 INFO L495 AbstractCegarLoop]: Abstraction has 4606 states and 6804 transitions. [2022-12-14 05:00:09,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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) [2022-12-14 05:00:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 4606 states and 6804 transitions. [2022-12-14 05:00:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-14 05:00:09,197 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:00:09,198 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:00:09,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 05:00:09,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2022-12-14 05:00:09,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-14 05:00:09,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:00:09,799 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 05:00:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:00:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1799258641, now seen corresponding path program 2 times [2022-12-14 05:00:09,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 05:00:09,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994523033] [2022-12-14 05:00:09,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 05:00:09,803 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 [2022-12-14 05:00:09,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 05:00:09,805 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 05:00:09,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 05:00:10,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 05:00:10,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:00:10,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 05:00:10,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:00:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:00:10,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:00:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:00:10,463 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 05:00:10,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994523033] [2022-12-14 05:00:10,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994523033] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:00:10,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [639123527] [2022-12-14 05:00:10,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 05:00:10,464 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 05:00:10,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 05:00:10,465 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 05:00:10,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-12-14 05:00:11,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 05:00:11,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:00:11,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 05:00:11,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:00:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:00:11,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:00:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:00:11,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [639123527] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:00:11,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151944861] [2022-12-14 05:00:11,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 05:00:11,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:00:11,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:00:11,947 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:00:11,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-14 05:01:00,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 05:01:00,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:01:00,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 05:01:00,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:01:00,258 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 05:01:00,259 INFO L350 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 [2022-12-14 05:01:00,278 INFO L350 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 13 treesize of output 9 [2022-12-14 05:01:00,586 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:01:00,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 05:01:00,646 INFO L350 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 [2022-12-14 05:01:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:01:00,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:01:00,759 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 05:01:00,759 INFO L350 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 [2022-12-14 05:01:00,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151944861] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:01:00,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 05:01:00,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-12-14 05:01:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271545809] [2022-12-14 05:01:00,836 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 05:01:00,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 05:01:00,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 05:01:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 05:01:00,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=551, Unknown=9, NotChecked=0, Total=650 [2022-12-14 05:01:00,837 INFO L87 Difference]: Start difference. First operand 4606 states and 6804 transitions. Second operand has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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) [2022-12-14 05:01:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:01:27,577 INFO L93 Difference]: Finished difference Result 11538 states and 17506 transitions. [2022-12-14 05:01:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 05:01:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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 79 [2022-12-14 05:01:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:01:27,603 INFO L225 Difference]: With dead ends: 11538 [2022-12-14 05:01:27,603 INFO L226 Difference]: Without dead ends: 11534 [2022-12-14 05:01:27,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 368 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=478, Invalid=2792, Unknown=36, NotChecked=0, Total=3306 [2022-12-14 05:01:27,605 INFO L413 NwaCegarLoop]: 1591 mSDtfsCounter, 4191 mSDsluCounter, 23629 mSDsCounter, 0 mSdLazyCounter, 21110 mSolverCounterSat, 88 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4211 SdHoareTripleChecker+Valid, 25220 SdHoareTripleChecker+Invalid, 21205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 21110 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:01:27,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4211 Valid, 25220 Invalid, 21205 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [88 Valid, 21110 Invalid, 7 Unknown, 0 Unchecked, 25.2s Time] [2022-12-14 05:01:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11534 states. [2022-12-14 05:01:27,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11534 to 4614. [2022-12-14 05:01:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4614 states, 3934 states have (on average 1.7094560244026435) internal successors, (6725), 4572 states have internal predecessors, (6725), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-12-14 05:01:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 6813 transitions. [2022-12-14 05:01:27,667 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 6813 transitions. Word has length 79 [2022-12-14 05:01:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:01:27,667 INFO L495 AbstractCegarLoop]: Abstraction has 4614 states and 6813 transitions. [2022-12-14 05:01:27,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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) [2022-12-14 05:01:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 6813 transitions. [2022-12-14 05:01:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-14 05:01:27,668 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:01:27,668 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:01:27,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2022-12-14 05:01:27,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-12-14 05:01:28,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-14 05:01:28,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:01:28,269 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 05:01:28,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:01:28,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1875379824, now seen corresponding path program 1 times [2022-12-14 05:01:28,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 05:01:28,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999344280] [2022-12-14 05:01:28,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:01:28,270 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 [2022-12-14 05:01:28,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 05:01:28,271 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 05:01:28,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 05:01:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:01:28,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 05:01:28,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:01:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:01:28,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:01:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:01:29,110 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 05:01:29,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999344280] [2022-12-14 05:01:29,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999344280] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:01:29,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [722317449] [2022-12-14 05:01:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:01:29,111 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 05:01:29,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 05:01:29,111 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 05:01:29,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-12-14 05:01:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:01:29,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 05:01:29,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:01:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:01:29,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:01:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:01:29,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [722317449] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:01:29,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654923651] [2022-12-14 05:01:29,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:01:29,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:01:29,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:01:29,826 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:01:29,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-14 05:01:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:01:30,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 05:01:30,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:01:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:01:30,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:01:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:01:30,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654923651] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:01:30,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 05:01:30,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-12-14 05:01:30,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500716400] [2022-12-14 05:01:30,935 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 05:01:30,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 05:01:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 05:01:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 05:01:30,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 05:01:30,937 INFO L87 Difference]: Start difference. First operand 4614 states and 6813 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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) [2022-12-14 05:01:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:01:33,875 INFO L93 Difference]: Finished difference Result 4656 states and 6915 transitions. [2022-12-14 05:01:33,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-14 05:01:33,876 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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 85 [2022-12-14 05:01:33,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:01:33,880 INFO L225 Difference]: With dead ends: 4656 [2022-12-14 05:01:33,880 INFO L226 Difference]: Without dead ends: 4650 [2022-12-14 05:01:33,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2022-12-14 05:01:33,881 INFO L413 NwaCegarLoop]: 1715 mSDtfsCounter, 62 mSDsluCounter, 18834 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 20549 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:01:33,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 20549 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 05:01:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2022-12-14 05:01:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4632. [2022-12-14 05:01:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 3952 states have (on average 1.70748987854251) internal successors, (6748), 4590 states have internal predecessors, (6748), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-12-14 05:01:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 6836 transitions. [2022-12-14 05:01:33,915 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 6836 transitions. Word has length 85 [2022-12-14 05:01:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:01:33,915 INFO L495 AbstractCegarLoop]: Abstraction has 4632 states and 6836 transitions. [2022-12-14 05:01:33,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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) [2022-12-14 05:01:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 6836 transitions. [2022-12-14 05:01:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 05:01:33,916 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:01:33,916 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:01:33,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 05:01:34,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2022-12-14 05:01:34,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-14 05:01:34,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:01:34,518 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 05:01:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:01:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash -905623344, now seen corresponding path program 2 times [2022-12-14 05:01:34,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 05:01:34,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228058092] [2022-12-14 05:01:34,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 05:01:34,523 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 [2022-12-14 05:01:34,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 05:01:34,524 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 05:01:34,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 05:01:35,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 05:01:35,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:01:35,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 05:01:35,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:01:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:01:35,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:01:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:01:36,746 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 05:01:36,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228058092] [2022-12-14 05:01:36,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228058092] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:01:36,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [458214412] [2022-12-14 05:01:36,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 05:01:36,747 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 05:01:36,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 05:01:36,747 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 05:01:36,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-12-14 05:01:38,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 05:01:38,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:01:38,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 05:01:38,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:01:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:01:38,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:01:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:01:38,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [458214412] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:01:38,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143858978] [2022-12-14 05:01:38,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 05:01:38,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:01:38,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:01:38,733 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:01:38,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-14 05:02:17,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 05:02:17,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:02:17,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 05:02:17,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:02:17,266 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 05:02:17,266 INFO L350 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 [2022-12-14 05:02:17,272 INFO L350 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 [2022-12-14 05:02:17,335 INFO L350 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 13 treesize of output 9 [2022-12-14 05:02:17,342 INFO L350 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 [2022-12-14 05:02:17,581 INFO L350 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 [2022-12-14 05:02:17,584 INFO L350 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 [2022-12-14 05:02:17,678 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:02:17,686 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3554) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:02:17,695 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556)))) is different from true [2022-12-14 05:02:17,703 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557)))) is different from true [2022-12-14 05:02:17,711 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559)))) is different from true [2022-12-14 05:02:17,720 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3561))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3562)))) is different from true [2022-12-14 05:02:17,728 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:02:17,928 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569)))) is different from true [2022-12-14 05:02:17,937 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3572))) (exists ((v_ArrVal_3571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3571) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:02:17,946 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573))) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:02:17,954 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3575) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3576)))) is different from true [2022-12-14 05:02:17,963 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:02:17,973 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3580))) (exists ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3579) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:02:17,981 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:02:17,990 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3583))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3584)))) is different from true [2022-12-14 05:02:18,000 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586)))) is different from true [2022-12-14 05:02:18,010 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588))) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587)))) is different from true [2022-12-14 05:02:18,020 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590)))) is different from true [2022-12-14 05:02:18,030 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592)))) is different from true [2022-12-14 05:02:18,041 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593))) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594)))) is different from true [2022-12-14 05:02:18,073 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:02:18,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 05:02:18,079 INFO L350 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 22 treesize of output 24 [2022-12-14 05:02:18,223 INFO L350 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 [2022-12-14 05:02:18,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 05:02:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 250 not checked. [2022-12-14 05:02:18,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:02:18,988 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3641 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3641) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3642 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-12-14 05:02:18,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143858978] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:02:18,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 05:02:18,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 29] total 78 [2022-12-14 05:02:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852327076] [2022-12-14 05:02:18,995 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 05:02:18,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-12-14 05:02:18,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 05:02:18,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-12-14 05:02:19,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=738, Invalid=2838, Unknown=48, NotChecked=2856, Total=6480 [2022-12-14 05:02:19,001 INFO L87 Difference]: Start difference. First operand 4632 states and 6836 transitions. Second operand has 78 states, 77 states have (on average 2.5714285714285716) internal successors, (198), 78 states have internal predecessors, (198), 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) [2022-12-14 05:02:51,987 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589))) (exists ((v_ArrVal_3566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3566))) (exists ((v_ArrVal_3583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3583))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3565))) (exists ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3580))) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3572))) (exists ((v_ArrVal_3571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3575) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573))) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587))) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592))) (exists ((v_ArrVal_3584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3584))) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593))) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594))) (exists ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3579) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3576))) (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590))) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:04:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:04:08,734 INFO L93 Difference]: Finished difference Result 12301 states and 18711 transitions. [2022-12-14 05:04:08,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-12-14 05:04:08,735 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 2.5714285714285716) internal successors, (198), 78 states have internal predecessors, (198), 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 97 [2022-12-14 05:04:08,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:04:08,745 INFO L225 Difference]: With dead ends: 12301 [2022-12-14 05:04:08,745 INFO L226 Difference]: Without dead ends: 12285 [2022-12-14 05:04:08,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 202 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 6925 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=6580, Invalid=25170, Unknown=1280, NotChecked=8382, Total=41412 [2022-12-14 05:04:08,751 INFO L413 NwaCegarLoop]: 1823 mSDtfsCounter, 4130 mSDsluCounter, 49740 mSDsCounter, 0 mSdLazyCounter, 53088 mSolverCounterSat, 207 mSolverCounterUnsat, 1769 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4187 SdHoareTripleChecker+Valid, 51563 SdHoareTripleChecker+Invalid, 136834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 53088 IncrementalHoareTripleChecker+Invalid, 1769 IncrementalHoareTripleChecker+Unknown, 81770 IncrementalHoareTripleChecker+Unchecked, 78.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:04:08,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4187 Valid, 51563 Invalid, 136834 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [207 Valid, 53088 Invalid, 1769 Unknown, 81770 Unchecked, 78.8s Time] [2022-12-14 05:04:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12285 states. [2022-12-14 05:04:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12285 to 4714. [2022-12-14 05:04:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4714 states, 4034 states have (on average 1.6955875061973227) internal successors, (6840), 4671 states have internal predecessors, (6840), 41 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-12-14 05:04:08,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 6928 transitions. [2022-12-14 05:04:08,820 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 6928 transitions. Word has length 97 [2022-12-14 05:04:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:04:08,820 INFO L495 AbstractCegarLoop]: Abstraction has 4714 states and 6928 transitions. [2022-12-14 05:04:08,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 2.5714285714285716) internal successors, (198), 78 states have internal predecessors, (198), 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) [2022-12-14 05:04:08,821 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 6928 transitions. [2022-12-14 05:04:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 05:04:08,821 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:04:08,822 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:04:08,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-12-14 05:04:09,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 05:04:09,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2022-12-14 05:04:09,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 05:04:09,424 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 05:04:09,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:04:09,425 INFO L85 PathProgramCache]: Analyzing trace with hash -462913067, now seen corresponding path program 1 times [2022-12-14 05:04:09,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 05:04:09,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038854747] [2022-12-14 05:04:09,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:04:09,427 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 [2022-12-14 05:04:09,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 05:04:09,428 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 05:04:09,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 05:04:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:04:10,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 05:04:10,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:04:10,148 INFO L350 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 [2022-12-14 05:04:10,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:04:10,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:04:10,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:04:10,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-12-14 05:04:10,226 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 05:04:10,226 INFO L350 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 [2022-12-14 05:04:10,298 INFO L350 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 45 treesize of output 41 [2022-12-14 05:04:10,361 INFO L350 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 45 treesize of output 41 [2022-12-14 05:04:10,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:04:10,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-12-14 05:04:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-12-14 05:04:10,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:04:10,437 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 05:04:10,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038854747] [2022-12-14 05:04:10,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038854747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:04:10,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:04:10,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 05:04:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154692146] [2022-12-14 05:04:10,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:04:10,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 05:04:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 05:04:10,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 05:04:10,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:04:10,438 INFO L87 Difference]: Start difference. First operand 4714 states and 6928 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2022-12-14 05:04:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:04:15,371 INFO L93 Difference]: Finished difference Result 4549 states and 6496 transitions. [2022-12-14 05:04:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:04:15,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 119 [2022-12-14 05:04:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:04:15,376 INFO L225 Difference]: With dead ends: 4549 [2022-12-14 05:04:15,376 INFO L226 Difference]: Without dead ends: 4549 [2022-12-14 05:04:15,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 05:04:15,377 INFO L413 NwaCegarLoop]: 1019 mSDtfsCounter, 1732 mSDsluCounter, 2270 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 3289 SdHoareTripleChecker+Invalid, 2446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:04:15,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 3289 Invalid, 2446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2410 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-12-14 05:04:15,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2022-12-14 05:04:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 4314. [2022-12-14 05:04:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4314 states, 3635 states have (on average 1.71939477303989) internal successors, (6250), 4274 states have internal predecessors, (6250), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2022-12-14 05:04:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4314 states to 4314 states and 6331 transitions. [2022-12-14 05:04:15,412 INFO L78 Accepts]: Start accepts. Automaton has 4314 states and 6331 transitions. Word has length 119 [2022-12-14 05:04:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:04:15,412 INFO L495 AbstractCegarLoop]: Abstraction has 4314 states and 6331 transitions. [2022-12-14 05:04:15,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2022-12-14 05:04:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 6331 transitions. [2022-12-14 05:04:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-12-14 05:04:15,414 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:04:15,414 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:04:15,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-12-14 05:04:15,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 05:04:15,615 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 05:04:15,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:04:15,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1638848775, now seen corresponding path program 1 times [2022-12-14 05:04:15,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 05:04:15,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006622566] [2022-12-14 05:04:15,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:04:15,619 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 [2022-12-14 05:04:15,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 05:04:15,623 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 05:04:15,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-12-14 05:04:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:04:16,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 05:04:16,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:04:16,417 INFO L350 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 [2022-12-14 05:04:16,510 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 05:04:16,510 INFO L350 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 [2022-12-14 05:04:16,530 INFO L350 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 13 treesize of output 9 [2022-12-14 05:04:16,602 INFO L350 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 [2022-12-14 05:04:16,971 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4411)))) is different from true [2022-12-14 05:04:17,090 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4416) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:04:17,157 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4419 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4419) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:04:17,243 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4423) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:04:17,615 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4439)))) is different from true [2022-12-14 05:04:17,733 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:04:17,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 05:04:17,827 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:04:17,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 05:04:17,846 INFO L350 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 [2022-12-14 05:04:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 741 trivial. 210 not checked. [2022-12-14 05:04:17,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:04:19,978 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4443 (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_4443) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 05:04:20,186 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4489 (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~mem39#1.base| v_ArrVal_4489))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4443)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 05:04:20,188 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 05:04:20,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006622566] [2022-12-14 05:04:20,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006622566] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:04:20,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [98673573] [2022-12-14 05:04:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:04:20,189 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 05:04:20,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 05:04:20,189 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 05:04:20,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-12-14 05:04:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:04:23,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 05:04:23,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:04:23,342 INFO L350 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 [2022-12-14 05:04:23,462 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 05:04:23,463 INFO L350 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 [2022-12-14 05:04:23,479 INFO L350 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 13 treesize of output 9 [2022-12-14 05:04:23,538 INFO L350 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 [2022-12-14 05:04:23,659 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4871 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4871) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:04:23,672 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4872) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:04:23,747 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4875) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:04:23,817 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4878)))) is different from true [2022-12-14 05:04:23,886 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4881)))) is different from true [2022-12-14 05:04:24,025 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4886 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4886) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:04:24,527 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905)))) is different from true [2022-12-14 05:04:24,591 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4908)))) is different from true [2022-12-14 05:04:24,688 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_4912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4912) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:04:24,733 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:04:24,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 05:04:24,800 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:04:24,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 05:04:24,822 INFO L350 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 [2022-12-14 05:04:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 595 trivial. 360 not checked. [2022-12-14 05:04:24,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:04:27,107 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4443 (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~mem39#1.base| v_ArrVal_4959))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4443)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 05:04:27,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [98673573] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:04:27,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006918459] [2022-12-14 05:04:27,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:04:27,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:04:27,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:04:27,111 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:04:27,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-14 05:04:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:04:27,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 05:04:27,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:04:27,678 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 05:04:27,678 INFO L350 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 [2022-12-14 05:04:27,708 INFO L350 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 13 treesize of output 9 [2022-12-14 05:04:29,620 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:04:29,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 05:04:29,767 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:04:29,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 05:04:29,784 INFO L350 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 [2022-12-14 05:04:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-14 05:04:29,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:04:29,806 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5381) |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 [2022-12-14 05:04:29,818 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5381 (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_5381) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-14 05:04:30,075 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-12-14 05:04:30,075 INFO L350 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 [2022-12-14 05:04:30,083 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5427 (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~mem39#1.base| v_ArrVal_5427))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5381)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem39#1.base|)) is different from false [2022-12-14 05:04:30,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006918459] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:04:30,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:04:30,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 12] total 33 [2022-12-14 05:04:30,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783910106] [2022-12-14 05:04:30,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:04:30,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 05:04:30,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 05:04:30,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 05:04:30,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=393, Unknown=39, NotChecked=1180, Total=1722 [2022-12-14 05:04:30,086 INFO L87 Difference]: Start difference. First operand 4314 states and 6331 transitions. Second operand has 34 states, 31 states have (on average 5.032258064516129) internal successors, (156), 33 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) [2022-12-14 05:04:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:04:58,019 INFO L93 Difference]: Finished difference Result 11180 states and 16933 transitions. [2022-12-14 05:04:58,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 05:04:58,020 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.032258064516129) internal successors, (156), 33 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 122 [2022-12-14 05:04:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:04:58,028 INFO L225 Difference]: With dead ends: 11180 [2022-12-14 05:04:58,028 INFO L226 Difference]: Without dead ends: 11180 [2022-12-14 05:04:58,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 225 SyntacticMatches, 122 SemanticMatches, 50 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=197, Invalid=825, Unknown=50, NotChecked=1580, Total=2652 [2022-12-14 05:04:58,029 INFO L413 NwaCegarLoop]: 1097 mSDtfsCounter, 4921 mSDsluCounter, 9587 mSDsCounter, 0 mSdLazyCounter, 9247 mSolverCounterSat, 64 mSolverCounterUnsat, 3021 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4937 SdHoareTripleChecker+Valid, 10684 SdHoareTripleChecker+Invalid, 64906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 9247 IncrementalHoareTripleChecker+Invalid, 3021 IncrementalHoareTripleChecker+Unknown, 52574 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:04:58,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4937 Valid, 10684 Invalid, 64906 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 9247 Invalid, 3021 Unknown, 52574 Unchecked, 27.1s Time] [2022-12-14 05:04:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11180 states. [2022-12-14 05:04:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11180 to 4313. [2022-12-14 05:04:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4313 states, 3635 states have (on average 1.718569463548831) internal successors, (6247), 4273 states have internal predecessors, (6247), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2022-12-14 05:04:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 6328 transitions. [2022-12-14 05:04:58,085 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 6328 transitions. Word has length 122 [2022-12-14 05:04:58,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:04:58,085 INFO L495 AbstractCegarLoop]: Abstraction has 4313 states and 6328 transitions. [2022-12-14 05:04:58,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.032258064516129) internal successors, (156), 33 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) [2022-12-14 05:04:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 6328 transitions. [2022-12-14 05:04:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-12-14 05:04:58,086 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:04:58,086 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:04:58,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-12-14 05:04:58,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2022-12-14 05:04:58,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2022-12-14 05:04:58,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 05:04:58,689 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-12-14 05:04:58,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:04:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1638848774, now seen corresponding path program 1 times [2022-12-14 05:04:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 05:04:58,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867184619] [2022-12-14 05:04:58,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:04:58,692 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 [2022-12-14 05:04:58,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 05:04:58,693 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 05:04:58,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-12-14 05:04:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:04:59,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-14 05:04:59,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:04:59,528 INFO L350 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 [2022-12-14 05:04:59,625 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 05:04:59,626 INFO L350 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 [2022-12-14 05:04:59,632 INFO L350 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 [2022-12-14 05:04:59,651 INFO L350 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 13 treesize of output 9 [2022-12-14 05:04:59,664 INFO L350 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 [2022-12-14 05:04:59,757 INFO L350 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 [2022-12-14 05:04:59,763 INFO L350 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 [2022-12-14 05:04:59,821 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5809))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5810 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5810) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:04:59,833 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5811))) (exists ((v_ArrVal_5812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5812)))) is different from true [2022-12-14 05:04:59,915 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5817)))) is different from true [2022-12-14 05:04:59,957 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821))) (exists ((v_ArrVal_5822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5822) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:04:59,970 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5824))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:04:59,982 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5825) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5826) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:04:59,997 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5828 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5828))) (exists ((v_ArrVal_5827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5827)))) is different from true [2022-12-14 05:05:00,010 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5830))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829)))) is different from true [2022-12-14 05:05:00,023 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5831))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5832 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5832) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:05:00,036 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5833 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5833) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5834)))) is different from true [2022-12-14 05:05:00,048 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5836))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5835)))) is different from true [2022-12-14 05:05:00,061 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5837) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5838)))) is different from true [2022-12-14 05:05:00,074 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5840))) (exists ((v_ArrVal_5839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5839)))) is different from true [2022-12-14 05:05:00,086 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5841))) (exists ((v_ArrVal_5842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5842) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:05:00,099 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5844) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5843 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5843)))) is different from true [2022-12-14 05:05:00,111 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5846 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5846))) (exists ((v_ArrVal_5845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5845))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:05:00,124 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5847))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5848)))) is different from true [2022-12-14 05:05:00,137 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5849) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850)))) is different from true [2022-12-14 05:05:00,150 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5851))) (exists ((v_ArrVal_5852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5852)))) is different from true [2022-12-14 05:05:00,163 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5853) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5854) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:05:00,176 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5856))) (exists ((v_ArrVal_5855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5855) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:05:00,188 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5858))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5857)))) is different from true [2022-12-14 05:05:00,203 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5860) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5859)))) is different from true [2022-12-14 05:05:00,216 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5861))) (exists ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5862))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:05:00,229 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5863))) (exists ((v_ArrVal_5864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5864) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:05:00,242 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5865 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5865))) (exists ((v_ArrVal_5866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5866)))) is different from true [2022-12-14 05:05:00,255 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5867) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5868)))) is different from true [2022-12-14 05:05:00,267 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5869))) (exists ((v_ArrVal_5870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5870) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:05:00,280 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5871))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5872)))) is different from true [2022-12-14 05:05:00,293 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5873))) (exists ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5874)))) is different from true [2022-12-14 05:05:00,305 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5875))) (exists ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5876)))) is different from true [2022-12-14 05:05:00,319 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5878) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5877 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5877) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:05:00,332 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5880))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5879) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:05:00,345 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5881))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5882)))) is different from true [2022-12-14 05:05:00,358 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5884))) (exists ((v_ArrVal_5883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5883)))) is different from true [2022-12-14 05:05:00,369 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5886))) (exists ((v_ArrVal_5885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5885)))) is different from true [2022-12-14 05:05:00,380 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5887))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5888)))) is different from true [2022-12-14 05:05:00,390 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5889 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5889) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5890 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5890)))) is different from true [2022-12-14 05:05:00,399 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5891))) (exists ((v_ArrVal_5892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5892) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:05:00,408 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5894 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5894) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5893) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:05:00,419 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5895 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5895))) (exists ((v_ArrVal_5896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5896)))) is different from true [2022-12-14 05:05:00,457 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:05:00,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 05:05:00,463 INFO L350 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 22 treesize of output 24 [2022-12-14 05:05:00,572 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:05:00,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 05:05:00,583 INFO L350 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 22 treesize of output 24 [2022-12-14 05:05:00,604 INFO L350 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 [2022-12-14 05:05:00,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 05:05:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2022-12-14 05:05:00,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:05:00,793 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5898) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-12-14 05:05:00,829 WARN L837 $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_5898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5898) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-12-14 05:05:01,623 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5990) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5989) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5989))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5990) .cse2 v_ArrVal_5897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5898) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-14 05:05:01,632 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 05:05:01,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867184619] [2022-12-14 05:05:01,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867184619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:05:01,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1617486026] [2022-12-14 05:05:01,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:05:01,633 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 05:05:01,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 05:05:01,634 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 05:05:01,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-12-14 05:07:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:07:03,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-12-14 05:07:03,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:07:03,652 INFO L350 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 [2022-12-14 05:07:03,754 INFO L350 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 [2022-12-14 05:07:03,764 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 05:07:03,764 INFO L350 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 [2022-12-14 05:07:03,770 INFO L350 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 [2022-12-14 05:07:03,778 INFO L350 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 13 treesize of output 9 [2022-12-14 05:07:03,833 INFO L350 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 [2022-12-14 05:07:03,837 INFO L350 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 [2022-12-14 05:07:03,884 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6373))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6372) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:07:03,896 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6375)))) is different from true [2022-12-14 05:07:03,908 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6376) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6377)))) is different from true [2022-12-14 05:07:03,919 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6379))) (exists ((v_ArrVal_6378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6378) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:07:03,930 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6380))) (exists ((v_ArrVal_6381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6381) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:07:03,941 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6382))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6383 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6383) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:07:03,951 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6384 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6384))) (exists ((v_ArrVal_6385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6385)))) is different from true [2022-12-14 05:07:03,962 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6386 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6386))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:07:03,973 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6388) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6389)))) is different from true [2022-12-14 05:07:03,985 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6390 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6390))) (exists ((v_ArrVal_6391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6391)))) is different from true [2022-12-14 05:07:03,997 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6393))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6392) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:04,008 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6394))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6395) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:04,020 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6396) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6397)))) is different from true [2022-12-14 05:07:04,032 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6399))) (exists ((v_ArrVal_6398 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6398) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:07:04,044 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6400) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6401)))) is different from true [2022-12-14 05:07:04,056 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6402 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6402) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6403)))) is different from true [2022-12-14 05:07:04,067 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6404 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6404) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6405) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:04,079 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6407))) (exists ((v_ArrVal_6406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6406)))) is different from true [2022-12-14 05:07:04,091 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6408) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6409) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:04,103 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6411) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6410)))) is different from true [2022-12-14 05:07:04,115 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6413))) (exists ((v_ArrVal_6412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6412)))) is different from true [2022-12-14 05:07:04,126 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6414))) (exists ((v_ArrVal_6415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6415))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:07:04,137 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6416) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6417)))) is different from true [2022-12-14 05:07:04,147 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6419))) (exists ((v_ArrVal_6418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6418)))) is different from true [2022-12-14 05:07:04,158 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6420 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6420) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6421) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:04,168 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6423))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6422 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6422) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:04,183 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6425 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6425) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6424)))) is different from true [2022-12-14 05:07:04,194 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6427) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6426)))) is different from true [2022-12-14 05:07:04,205 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6428))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6429)))) is different from true [2022-12-14 05:07:04,215 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6431))) (exists ((v_ArrVal_6430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6430) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:07:04,226 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6432 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6432) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6433)))) is different from true [2022-12-14 05:07:04,237 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6434 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6434) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6435) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:04,247 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6437))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6436)))) is different from true [2022-12-14 05:07:04,258 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6439))) (exists ((v_ArrVal_6438 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6438) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:07:04,268 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6441))) (exists ((v_ArrVal_6440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6440) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:04,279 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6442) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6443)))) is different from true [2022-12-14 05:07:04,290 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6445))) (exists ((v_ArrVal_6444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6444)))) is different from true [2022-12-14 05:07:04,300 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6446))) (exists ((v_ArrVal_6447 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6447) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:07:04,311 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6449))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6448)))) is different from true [2022-12-14 05:07:04,321 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6450))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6451)))) is different from true [2022-12-14 05:07:04,333 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6452))) (exists ((v_ArrVal_6453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6453) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:07:04,344 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6454))) (exists ((v_ArrVal_6455 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6455) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:07:04,354 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6457))) (exists ((v_ArrVal_6456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6456)))) is different from true [2022-12-14 05:07:04,366 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6459) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6458)))) is different from true [2022-12-14 05:07:04,409 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:07:04,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 05:07:04,418 INFO L350 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 22 treesize of output 24 [2022-12-14 05:07:04,483 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:07:04,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 05:07:04,490 INFO L350 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 22 treesize of output 24 [2022-12-14 05:07:04,517 INFO L350 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 [2022-12-14 05:07:04,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 05:07:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-12-14 05:07:04,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:07:04,582 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 05:07:04,613 WARN L837 $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_6461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-14 05:07:05,366 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6552))) (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~mem39#1.base| v_ArrVal_6553) .cse0 v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6553) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6552) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-12-14 05:07:05,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1617486026] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:07:05,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367287093] [2022-12-14 05:07:05,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:07:05,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:07:05,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:07:05,375 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:07:05,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb81ee96-26e1-483e-bbc6-2291df7d3014/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-14 05:07:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:07:05,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-14 05:07:05,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:07:05,951 INFO L350 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 [2022-12-14 05:07:05,962 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 05:07:05,962 INFO L350 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 [2022-12-14 05:07:05,969 INFO L350 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 [2022-12-14 05:07:05,977 INFO L350 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 13 treesize of output 9 [2022-12-14 05:07:06,034 INFO L350 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 [2022-12-14 05:07:06,038 INFO L350 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 [2022-12-14 05:07:06,084 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935)))) is different from true [2022-12-14 05:07:06,095 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6937) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6936) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:06,105 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6938) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6939)))) is different from true [2022-12-14 05:07:06,142 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6943))) (exists ((v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6942)))) is different from true [2022-12-14 05:07:06,208 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6948))) (exists ((v_ArrVal_6949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6949)))) is different from true [2022-12-14 05:07:06,272 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6954))) (exists ((v_ArrVal_6955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6955)))) is different from true [2022-12-14 05:07:06,283 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956)))) is different from true [2022-12-14 05:07:06,321 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6961) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6960) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:06,332 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962)))) is different from true [2022-12-14 05:07:06,369 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6966))) (exists ((v_ArrVal_6967 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6967)))) is different from true [2022-12-14 05:07:06,380 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969)))) is different from true [2022-12-14 05:07:06,391 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971)))) is different from true [2022-12-14 05:07:06,402 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6972))) (exists ((v_ArrVal_6973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6973)))) is different from true [2022-12-14 05:07:06,494 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:07:06,504 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6983))) (exists ((v_ArrVal_6982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6982) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:07:06,515 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6984) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6985)))) is different from true [2022-12-14 05:07:06,526 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986))) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987)))) is different from true [2022-12-14 05:07:06,536 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6988))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6989)))) is different from true [2022-12-14 05:07:06,547 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6991) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6990)))) is different from true [2022-12-14 05:07:06,557 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6992) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6993)))) is different from true [2022-12-14 05:07:06,568 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:06,586 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6997) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6996)))) is different from true [2022-12-14 05:07:06,596 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6999))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6998)))) is different from true [2022-12-14 05:07:06,607 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7001))) (exists ((v_ArrVal_7000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7000) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:06,617 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7003) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7002)))) is different from true [2022-12-14 05:07:06,627 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7005))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7004) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:06,638 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7006))) (exists ((v_ArrVal_7007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7007)))) is different from true [2022-12-14 05:07:06,648 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7009) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7008)))) is different from true [2022-12-14 05:07:06,659 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7010))) (exists ((v_ArrVal_7011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7011))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:07:06,669 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7012))) (exists ((v_ArrVal_7013 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7013) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:06,680 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7014))) (exists ((v_ArrVal_7015 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7015) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-12-14 05:07:06,690 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7017))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7016)))) is different from true [2022-12-14 05:07:06,701 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7019))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7018)))) is different from true [2022-12-14 05:07:06,712 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7021 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7021) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7020) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 05:07:06,750 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:07:06,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 05:07:06,762 INFO L350 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 22 treesize of output 24 [2022-12-14 05:07:06,824 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:07:06,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 05:07:06,835 INFO L350 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 22 treesize of output 24 [2022-12-14 05:07:06,853 INFO L350 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 [2022-12-14 05:07:06,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 05:07:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 935 not checked. [2022-12-14 05:07:06,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:07:06,923 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7023 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 05:07:06,955 WARN L837 $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_7022 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7023 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-14 05:07:07,700 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7114))) (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~mem39#1.base| v_ArrVal_7115) .cse0 v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7115) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2022-12-14 05:07:07,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367287093] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:07:07,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:07:07,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 52, 44] total 129 [2022-12-14 05:07:07,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307132275] [2022-12-14 05:07:07,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:07:07,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-12-14 05:07:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 05:07:07,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-12-14 05:07:07,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=248, Unknown=135, NotChecked=19072, Total=19740 [2022-12-14 05:07:07,708 INFO L87 Difference]: Start difference. First operand 4313 states and 6328 transitions. Second operand has 130 states, 128 states have (on average 1.875) internal successors, (240), 130 states have internal predecessors, (240), 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) [2022-12-14 05:07:08,762 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5809))) (exists ((v_ArrVal_6373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6373))) (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5813))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935))) (exists ((v_ArrVal_5810 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5810) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6372) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814)))) is different from true [2022-12-14 05:07:08,832 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5824))) (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_ArrVal_6961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6961) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6938) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5813))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821))) (exists ((v_ArrVal_6954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6954))) (exists ((v_ArrVal_5822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5822) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6939))) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_6966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6966))) (exists ((v_ArrVal_6960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6960) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956))) (exists ((v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6376) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814))) (exists ((v_ArrVal_6955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6955))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6983))) (exists ((v_ArrVal_6967 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6967))) (exists ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6943))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5817))) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962))) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969))) (exists ((v_ArrVal_6948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6948))) (exists ((v_ArrVal_6377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6377))) (exists ((v_ArrVal_6949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6949))) (exists ((v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6942))) (exists ((v_ArrVal_6982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6982) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:07:08,839 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5824))) (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_6379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6379))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_ArrVal_6378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6378) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6961) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5813))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821))) (exists ((v_ArrVal_6954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6954))) (exists ((v_ArrVal_5822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5822) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5826) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6984) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_6985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6985))) (exists ((v_ArrVal_6966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6966))) (exists ((v_ArrVal_6960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6960) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956))) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814))) (exists ((v_ArrVal_6955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6955))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6983))) (exists ((v_ArrVal_6967 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6967))) (exists ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6943))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5817))) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962))) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969))) (exists ((v_ArrVal_6948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6948))) (exists ((v_ArrVal_6949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6949))) (exists ((v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6942))) (exists ((v_ArrVal_6982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6982) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:07:08,847 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5823) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5824))) (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_ArrVal_6380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6380))) (exists ((v_ArrVal_6961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6961) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6381) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5813))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5821))) (exists ((v_ArrVal_6954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6954))) (exists ((v_ArrVal_5822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5822) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6972))) (exists ((v_ArrVal_5826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5826) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6984) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986))) (exists ((v_ArrVal_6985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6985))) (exists ((v_ArrVal_5828 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5828))) (exists ((v_ArrVal_6966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6966))) (exists ((v_ArrVal_6960 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6960) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956))) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814))) (exists ((v_ArrVal_6955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6955))) (exists ((v_ArrVal_5818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5818) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6983))) (exists ((v_ArrVal_6967 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6967))) (exists ((v_ArrVal_6943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6943))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5817))) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962))) (exists ((v_ArrVal_6973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6973))) (exists ((v_ArrVal_5827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5827))) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969))) (exists ((v_ArrVal_6948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6948))) (exists ((v_ArrVal_6949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6949))) (exists ((v_ArrVal_6942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6942))) (exists ((v_ArrVal_6982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6982) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 05:07:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:07:33,049 INFO L93 Difference]: Finished difference Result 11204 states and 16956 transitions. [2022-12-14 05:07:33,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 05:07:33,050 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 128 states have (on average 1.875) internal successors, (240), 130 states have internal predecessors, (240), 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 122 [2022-12-14 05:07:33,050 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-12-14 05:07:33,050 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 128 states have (on average 1.875) internal successors, (240), 130 states have internal predecessors, (240), 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 122