./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0 --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 c098eb2ea0abe7b0f4b25f613d67df9ef36b2215e5396f258b75924d2167f9c8 --- 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-e04fb08 [2022-11-16 15:52:55,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 15:52:55,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 15:52:55,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 15:52:55,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 15:52:55,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 15:52:55,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 15:52:55,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 15:52:55,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 15:52:55,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 15:52:55,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 15:52:55,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 15:52:55,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 15:52:55,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 15:52:55,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 15:52:55,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 15:52:55,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 15:52:55,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 15:52:55,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 15:52:55,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 15:52:55,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 15:52:55,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 15:52:55,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 15:52:55,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 15:52:55,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 15:52:55,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 15:52:55,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 15:52:55,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 15:52:55,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 15:52:55,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 15:52:55,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 15:52:55,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 15:52:55,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 15:52:55,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 15:52:55,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 15:52:55,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 15:52:55,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 15:52:55,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 15:52:55,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 15:52:55,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 15:52:55,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 15:52:55,399 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-16 15:52:55,441 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 15:52:55,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 15:52:55,452 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 15:52:55,452 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 15:52:55,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 15:52:55,453 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 15:52:55,453 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 15:52:55,454 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 15:52:55,454 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 15:52:55,454 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 15:52:55,455 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 15:52:55,455 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 15:52:55,456 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 15:52:55,456 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 15:52:55,456 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 15:52:55,456 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 15:52:55,457 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 15:52:55,457 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 15:52:55,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 15:52:55,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 15:52:55,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 15:52:55,458 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 15:52:55,458 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 15:52:55,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 15:52:55,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 15:52:55,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 15:52:55,459 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 15:52:55,459 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 15:52:55,460 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 15:52:55,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 15:52:55,463 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 15:52:55,463 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 15:52:55,463 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 15:52:55,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 15:52:55,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 15:52:55,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 15:52:55,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 15:52:55,464 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 15:52:55,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 15:52:55,465 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 15:52:55,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 15:52:55,465 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 15:52:55,465 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_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/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_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0 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 -> c098eb2ea0abe7b0f4b25f613d67df9ef36b2215e5396f258b75924d2167f9c8 [2022-11-16 15:52:55,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 15:52:55,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 15:52:55,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 15:52:55,820 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 15:52:55,821 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 15:52:55,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2022-11-16 15:52:55,897 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/data/3c7d75eca/ea41e52fbe414bec954c43b01ce43612/FLAGdbcaf27f2 [2022-11-16 15:52:56,611 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 15:52:56,612 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2022-11-16 15:52:56,631 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/data/3c7d75eca/ea41e52fbe414bec954c43b01ce43612/FLAGdbcaf27f2 [2022-11-16 15:52:56,776 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/data/3c7d75eca/ea41e52fbe414bec954c43b01ce43612 [2022-11-16 15:52:56,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 15:52:56,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 15:52:56,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 15:52:56,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 15:52:56,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 15:52:56,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:52:56" (1/1) ... [2022-11-16 15:52:56,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ab22c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:56, skipping insertion in model container [2022-11-16 15:52:56,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:52:56" (1/1) ... [2022-11-16 15:52:56,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 15:52:56,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 15:52:57,369 WARN L229 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_537bf962-3c35-441b-951f-1c2138be6983/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] [2022-11-16 15:52:57,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 15:52:57,668 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-11-16 15:52:57,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@54f85661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:57, skipping insertion in model container [2022-11-16 15:52:57,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 15:52:57,670 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-16 15:52:57,673 INFO L158 Benchmark]: Toolchain (without parser) took 887.48ms. Allocated memory is still 102.8MB. Free memory was 79.2MB in the beginning and 56.7MB in the end (delta: 22.4MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2022-11-16 15:52:57,675 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 102.8MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 15:52:57,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 884.82ms. Allocated memory is still 102.8MB. Free memory was 79.2MB in the beginning and 56.7MB in the end (delta: 22.4MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2022-11-16 15:52:57,678 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.29ms. Allocated memory is still 102.8MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 884.82ms. Allocated memory is still 102.8MB. Free memory was 79.2MB in the beginning and 56.7MB in the end (delta: 22.4MB). Peak memory consumption was 23.4MB. 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0 --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 c098eb2ea0abe7b0f4b25f613d67df9ef36b2215e5396f258b75924d2167f9c8 --- 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-e04fb08 [2022-11-16 15:52:59,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 15:52:59,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 15:52:59,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 15:52:59,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 15:52:59,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 15:52:59,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 15:53:00,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 15:53:00,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 15:53:00,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 15:53:00,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 15:53:00,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 15:53:00,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 15:53:00,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 15:53:00,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 15:53:00,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 15:53:00,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 15:53:00,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 15:53:00,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 15:53:00,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 15:53:00,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 15:53:00,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 15:53:00,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 15:53:00,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 15:53:00,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 15:53:00,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 15:53:00,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 15:53:00,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 15:53:00,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 15:53:00,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 15:53:00,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 15:53:00,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 15:53:00,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 15:53:00,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 15:53:00,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 15:53:00,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 15:53:00,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 15:53:00,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 15:53:00,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 15:53:00,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 15:53:00,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 15:53:00,074 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-16 15:53:00,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 15:53:00,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 15:53:00,119 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 15:53:00,119 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 15:53:00,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 15:53:00,120 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 15:53:00,121 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 15:53:00,121 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 15:53:00,121 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 15:53:00,121 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 15:53:00,122 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 15:53:00,123 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 15:53:00,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 15:53:00,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 15:53:00,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 15:53:00,125 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 15:53:00,125 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 15:53:00,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 15:53:00,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 15:53:00,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 15:53:00,126 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 15:53:00,126 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 15:53:00,126 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 15:53:00,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 15:53:00,127 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 15:53:00,127 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 15:53:00,127 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 15:53:00,127 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 15:53:00,128 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 15:53:00,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 15:53:00,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 15:53:00,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 15:53:00,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 15:53:00,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 15:53:00,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 15:53:00,130 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-16 15:53:00,130 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 15:53:00,130 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 15:53:00,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 15:53:00,131 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_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/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_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0 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 -> c098eb2ea0abe7b0f4b25f613d67df9ef36b2215e5396f258b75924d2167f9c8 [2022-11-16 15:53:00,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 15:53:00,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 15:53:00,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 15:53:00,557 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 15:53:00,557 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 15:53:00,559 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2022-11-16 15:53:00,638 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/data/27ac3ce23/d2cc9c3157e34a2d95a3e42040ede14a/FLAG64191864f [2022-11-16 15:53:01,396 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 15:53:01,397 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2022-11-16 15:53:01,426 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/data/27ac3ce23/d2cc9c3157e34a2d95a3e42040ede14a/FLAG64191864f [2022-11-16 15:53:01,531 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/data/27ac3ce23/d2cc9c3157e34a2d95a3e42040ede14a [2022-11-16 15:53:01,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 15:53:01,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 15:53:01,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 15:53:01,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 15:53:01,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 15:53:01,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:53:01" (1/1) ... [2022-11-16 15:53:01,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c2667fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:01, skipping insertion in model container [2022-11-16 15:53:01,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:53:01" (1/1) ... [2022-11-16 15:53:01,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 15:53:01,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 15:53:02,271 WARN L229 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_537bf962-3c35-441b-951f-1c2138be6983/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] [2022-11-16 15:53:02,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 15:53:02,634 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 15:53:02,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 15:53:02,676 WARN L229 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_537bf962-3c35-441b-951f-1c2138be6983/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] [2022-11-16 15:53:02,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 15:53:02,805 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 15:53:02,837 WARN L229 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_537bf962-3c35-441b-951f-1c2138be6983/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] [2022-11-16 15:53:02,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 15:53:03,029 INFO L208 MainTranslator]: Completed translation [2022-11-16 15:53:03,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:03 WrapperNode [2022-11-16 15:53:03,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 15:53:03,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 15:53:03,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 15:53:03,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 15:53:03,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:03" (1/1) ... [2022-11-16 15:53:03,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:03" (1/1) ... [2022-11-16 15:53:03,211 INFO L138 Inliner]: procedures = 180, calls = 623, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2483 [2022-11-16 15:53:03,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 15:53:03,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 15:53:03,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 15:53:03,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 15:53:03,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:03" (1/1) ... [2022-11-16 15:53:03,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:03" (1/1) ... [2022-11-16 15:53:03,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:03" (1/1) ... [2022-11-16 15:53:03,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:03" (1/1) ... [2022-11-16 15:53:03,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:03" (1/1) ... [2022-11-16 15:53:03,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:03" (1/1) ... [2022-11-16 15:53:03,417 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:03" (1/1) ... [2022-11-16 15:53:03,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:03" (1/1) ... [2022-11-16 15:53:03,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 15:53:03,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 15:53:03,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 15:53:03,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 15:53:03,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:03" (1/1) ... [2022-11-16 15:53:03,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 15:53:03,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 15:53:03,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 15:53:03,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 15:53:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-16 15:53:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-11-16 15:53:03,526 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-11-16 15:53:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 15:53:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 15:53:03,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 15:53:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-16 15:53:03,526 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-16 15:53:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 15:53:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 15:53:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 15:53:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 15:53:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-16 15:53:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 15:53:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 15:53:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 15:53:03,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 15:53:03,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 15:53:03,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 15:53:03,900 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 15:53:03,902 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 15:53:03,906 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-16 15:53:15,004 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 15:53:15,025 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 15:53:15,025 INFO L300 CfgBuilder]: Removed 168 assume(true) statements. [2022-11-16 15:53:15,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 03:53:15 BoogieIcfgContainer [2022-11-16 15:53:15,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 15:53:15,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 15:53:15,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 15:53:15,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 15:53:15,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:53:01" (1/3) ... [2022-11-16 15:53:15,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47dd3234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:53:15, skipping insertion in model container [2022-11-16 15:53:15,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:53:03" (2/3) ... [2022-11-16 15:53:15,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47dd3234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:53:15, skipping insertion in model container [2022-11-16 15:53:15,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 03:53:15" (3/3) ... [2022-11-16 15:53:15,040 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test10-3.i [2022-11-16 15:53:15,060 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 15:53:15,060 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1193 error locations. [2022-11-16 15:53:15,135 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 15:53:15,141 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;@4294f686, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 15:53:15,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1193 error locations. [2022-11-16 15:53:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 2435 states, 1230 states have (on average 2.2284552845528456) internal successors, (2741), 2421 states have internal predecessors, (2741), 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-11-16 15:53:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 15:53:15,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:53:15,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 15:53:15,159 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:53:15,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:53:15,165 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-11-16 15:53:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:53:15,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817291516] [2022-11-16 15:53:15,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:53:15,179 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-11-16 15:53:15,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:53:15,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:15,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:53:15,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 15:53:15,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:53:15,512 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-11-16 15:53:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:53:15,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:53:15,549 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:53:15,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817291516] [2022-11-16 15:53:15,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817291516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:53:15,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:53:15,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 15:53:15,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396743589] [2022-11-16 15:53:15,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:53:15,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 15:53:15,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:53:15,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 15:53:15,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 15:53:15,637 INFO L87 Difference]: Start difference. First operand has 2435 states, 1230 states have (on average 2.2284552845528456) internal successors, (2741), 2421 states have internal predecessors, (2741), 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-11-16 15:53:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:53:22,008 INFO L93 Difference]: Finished difference Result 3278 states and 3477 transitions. [2022-11-16 15:53:22,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 15:53:22,011 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-11-16 15:53:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:53:22,052 INFO L225 Difference]: With dead ends: 3278 [2022-11-16 15:53:22,052 INFO L226 Difference]: Without dead ends: 3276 [2022-11-16 15:53:22,054 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-11-16 15:53:22,061 INFO L413 NwaCegarLoop]: 1661 mSDtfsCounter, 2314 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2324 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:53:22,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2324 Valid, 2224 Invalid, 1684 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-11-16 15:53:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2022-11-16 15:53:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 2577. [2022-11-16 15:53:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2577 states, 1396 states have (on average 2.067335243553009) internal successors, (2886), 2561 states have internal predecessors, (2886), 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-11-16 15:53:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2577 states and 2918 transitions. [2022-11-16 15:53:22,209 INFO L78 Accepts]: Start accepts. Automaton has 2577 states and 2918 transitions. Word has length 3 [2022-11-16 15:53:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:53:22,210 INFO L495 AbstractCegarLoop]: Abstraction has 2577 states and 2918 transitions. [2022-11-16 15:53:22,211 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-11-16 15:53:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2577 states and 2918 transitions. [2022-11-16 15:53:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 15:53:22,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:53:22,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 15:53:22,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:22,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:22,424 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:53:22,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:53:22,425 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-11-16 15:53:22,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:53:22,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971897592] [2022-11-16 15:53:22,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:53:22,426 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-11-16 15:53:22,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:53:22,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:22,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:53:22,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 15:53:22,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:53:22,710 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-11-16 15:53:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:53:22,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:53:22,722 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:53:22,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971897592] [2022-11-16 15:53:22,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971897592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:53:22,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:53:22,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 15:53:22,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639393874] [2022-11-16 15:53:22,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:53:22,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 15:53:22,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:53:22,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 15:53:22,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 15:53:22,726 INFO L87 Difference]: Start difference. First operand 2577 states and 2918 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-11-16 15:53:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:53:31,311 INFO L93 Difference]: Finished difference Result 3725 states and 4166 transitions. [2022-11-16 15:53:31,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 15:53:31,313 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-11-16 15:53:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:53:31,326 INFO L225 Difference]: With dead ends: 3725 [2022-11-16 15:53:31,326 INFO L226 Difference]: Without dead ends: 3725 [2022-11-16 15:53:31,327 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-11-16 15:53:31,328 INFO L413 NwaCegarLoop]: 2041 mSDtfsCounter, 1240 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 3425 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-16 15:53:31,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 3425 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-11-16 15:53:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3725 states. [2022-11-16 15:53:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3725 to 3026. [2022-11-16 15:53:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3026 states, 1843 states have (on average 2.023331524688009) internal successors, (3729), 3007 states have internal predecessors, (3729), 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-11-16 15:53:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 3767 transitions. [2022-11-16 15:53:31,420 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 3767 transitions. Word has length 3 [2022-11-16 15:53:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:53:31,421 INFO L495 AbstractCegarLoop]: Abstraction has 3026 states and 3767 transitions. [2022-11-16 15:53:31,421 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-11-16 15:53:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 3767 transitions. [2022-11-16 15:53:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 15:53:31,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:53:31,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:53:31,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 15:53:31,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:31,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:53:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:53:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-11-16 15:53:31,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:53:31,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65662360] [2022-11-16 15:53:31,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:53:31,635 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-11-16 15:53:31,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:53:31,638 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:31,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:53:31,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 15:53:31,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:53:31,888 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-11-16 15:53:31,898 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-11-16 15:53:31,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 15:53:31,969 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-11-16 15:53:31,992 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 15:53:31,993 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-11-16 15:53:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:53:32,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:53:32,028 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:53:32,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65662360] [2022-11-16 15:53:32,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65662360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:53:32,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:53:32,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:53:32,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142385025] [2022-11-16 15:53:32,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:53:32,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:53:32,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:53:32,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:53:32,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:53:32,031 INFO L87 Difference]: Start difference. First operand 3026 states and 3767 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-11-16 15:53:48,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:53:48,225 INFO L93 Difference]: Finished difference Result 6002 states and 6929 transitions. [2022-11-16 15:53:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 15:53:48,227 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-11-16 15:53:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:53:48,245 INFO L225 Difference]: With dead ends: 6002 [2022-11-16 15:53:48,245 INFO L226 Difference]: Without dead ends: 6002 [2022-11-16 15:53:48,246 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-11-16 15:53:48,247 INFO L413 NwaCegarLoop]: 977 mSDtfsCounter, 3126 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3136 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 4744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-11-16 15:53:48,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3136 Valid, 3150 Invalid, 4744 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 16.0s Time] [2022-11-16 15:53:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2022-11-16 15:53:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3743. [2022-11-16 15:53:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3743 states, 2560 states have (on average 2.0515625) internal successors, (5252), 3718 states have internal predecessors, (5252), 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-11-16 15:53:48,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5302 transitions. [2022-11-16 15:53:48,341 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5302 transitions. Word has length 7 [2022-11-16 15:53:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:53:48,341 INFO L495 AbstractCegarLoop]: Abstraction has 3743 states and 5302 transitions. [2022-11-16 15:53:48,342 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-11-16 15:53:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5302 transitions. [2022-11-16 15:53:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 15:53:48,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:53:48,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:53:48,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 15:53:48,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:48,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:53:48,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:53:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-11-16 15:53:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:53:48,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272458289] [2022-11-16 15:53:48,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:53:48,561 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-11-16 15:53:48,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:53:48,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:48,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:53:48,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 15:53:48,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:53:48,798 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-11-16 15:53:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:53:48,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:53:48,812 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:53:48,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272458289] [2022-11-16 15:53:48,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272458289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:53:48,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:53:48,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 15:53:48,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677765861] [2022-11-16 15:53:48,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:53:48,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 15:53:48,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:53:48,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 15:53:48,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 15:53:48,815 INFO L87 Difference]: Start difference. First operand 3743 states and 5302 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-11-16 15:53:53,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:53:53,790 INFO L93 Difference]: Finished difference Result 4947 states and 6819 transitions. [2022-11-16 15:53:53,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 15:53:53,791 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-11-16 15:53:53,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:53:53,809 INFO L225 Difference]: With dead ends: 4947 [2022-11-16 15:53:53,809 INFO L226 Difference]: Without dead ends: 4947 [2022-11-16 15:53:53,810 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-11-16 15:53:53,810 INFO L413 NwaCegarLoop]: 2362 mSDtfsCounter, 1994 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 3208 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-16 15:53:53,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2004 Valid, 3208 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-16 15:53:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2022-11-16 15:53:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 3652. [2022-11-16 15:53:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3652 states, 2560 states have (on average 1.968359375) internal successors, (5039), 3627 states have internal predecessors, (5039), 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-11-16 15:53:53,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 5089 transitions. [2022-11-16 15:53:53,935 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 5089 transitions. Word has length 8 [2022-11-16 15:53:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:53:53,935 INFO L495 AbstractCegarLoop]: Abstraction has 3652 states and 5089 transitions. [2022-11-16 15:53:53,936 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-11-16 15:53:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 5089 transitions. [2022-11-16 15:53:53,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 15:53:53,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:53:53,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:53:53,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 15:53:54,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:54,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:53:54,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:53:54,149 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-11-16 15:53:54,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:53:54,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442205058] [2022-11-16 15:53:54,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:53:54,149 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-11-16 15:53:54,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:53:54,150 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:54,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:53:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:53:54,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 15:53:54,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:53:54,383 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-11-16 15:53:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:53:54,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:53:54,413 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:53:54,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442205058] [2022-11-16 15:53:54,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442205058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:53:54,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:53:54,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 15:53:54,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104280812] [2022-11-16 15:53:54,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:53:54,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 15:53:54,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:53:54,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 15:53:54,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 15:53:54,416 INFO L87 Difference]: Start difference. First operand 3652 states and 5089 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-11-16 15:54:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:54:02,449 INFO L93 Difference]: Finished difference Result 5367 states and 7447 transitions. [2022-11-16 15:54:02,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 15:54:02,449 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-11-16 15:54:02,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:54:02,464 INFO L225 Difference]: With dead ends: 5367 [2022-11-16 15:54:02,464 INFO L226 Difference]: Without dead ends: 5367 [2022-11-16 15:54:02,465 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-11-16 15:54:02,465 INFO L413 NwaCegarLoop]: 2742 mSDtfsCounter, 1369 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-16 15:54:02,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3923 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-11-16 15:54:02,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2022-11-16 15:54:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 3974. [2022-11-16 15:54:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3974 states, 2892 states have (on average 1.9540110650069156) internal successors, (5651), 3949 states have internal predecessors, (5651), 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-11-16 15:54:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5701 transitions. [2022-11-16 15:54:02,555 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 5701 transitions. Word has length 8 [2022-11-16 15:54:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:54:02,556 INFO L495 AbstractCegarLoop]: Abstraction has 3974 states and 5701 transitions. [2022-11-16 15:54:02,556 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-11-16 15:54:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 5701 transitions. [2022-11-16 15:54:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 15:54:02,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:54:02,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:54:02,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 15:54:02,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:02,769 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:54:02,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:54:02,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1045354379, now seen corresponding path program 1 times [2022-11-16 15:54:02,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:54:02,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191950971] [2022-11-16 15:54:02,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:54:02,771 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-11-16 15:54:02,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:54:02,772 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:02,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:54:02,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 15:54:03,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:54:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:54:03,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:54:03,019 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:54:03,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191950971] [2022-11-16 15:54:03,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191950971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:54:03,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:54:03,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:54:03,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707809408] [2022-11-16 15:54:03,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:54:03,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 15:54:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:54:03,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 15:54:03,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 15:54:03,021 INFO L87 Difference]: Start difference. First operand 3974 states and 5701 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-11-16 15:54:03,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:54:03,071 INFO L93 Difference]: Finished difference Result 3914 states and 5615 transitions. [2022-11-16 15:54:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 15:54:03,072 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-11-16 15:54:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:54:03,093 INFO L225 Difference]: With dead ends: 3914 [2022-11-16 15:54:03,094 INFO L226 Difference]: Without dead ends: 3914 [2022-11-16 15:54:03,094 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-11-16 15:54:03,095 INFO L413 NwaCegarLoop]: 2403 mSDtfsCounter, 1197 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 3615 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-11-16 15:54:03,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 3615 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 15:54:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2022-11-16 15:54:03,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3914. [2022-11-16 15:54:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3914 states, 2856 states have (on average 1.9485294117647058) internal successors, (5565), 3889 states have internal predecessors, (5565), 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-11-16 15:54:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3914 states to 3914 states and 5615 transitions. [2022-11-16 15:54:03,172 INFO L78 Accepts]: Start accepts. Automaton has 3914 states and 5615 transitions. Word has length 11 [2022-11-16 15:54:03,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:54:03,173 INFO L495 AbstractCegarLoop]: Abstraction has 3914 states and 5615 transitions. [2022-11-16 15:54:03,173 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-11-16 15:54:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3914 states and 5615 transitions. [2022-11-16 15:54:03,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 15:54:03,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:54:03,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:54:03,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 15:54:03,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:03,387 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:54:03,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:54:03,388 INFO L85 PathProgramCache]: Analyzing trace with hash 436842575, now seen corresponding path program 1 times [2022-11-16 15:54:03,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:54:03,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126203797] [2022-11-16 15:54:03,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:54:03,389 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-11-16 15:54:03,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:54:03,392 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:03,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:54:03,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 15:54:03,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:54:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:54:03,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:54:03,648 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:54:03,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126203797] [2022-11-16 15:54:03,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126203797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:54:03,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:54:03,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:54:03,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162447504] [2022-11-16 15:54:03,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:54:03,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:54:03,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:54:03,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:54:03,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:54:03,651 INFO L87 Difference]: Start difference. First operand 3914 states and 5615 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-11-16 15:54:03,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:54:03,770 INFO L93 Difference]: Finished difference Result 3886 states and 5559 transitions. [2022-11-16 15:54:03,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 15:54:03,770 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-11-16 15:54:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:54:03,784 INFO L225 Difference]: With dead ends: 3886 [2022-11-16 15:54:03,784 INFO L226 Difference]: Without dead ends: 3886 [2022-11-16 15:54:03,785 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-11-16 15:54:03,786 INFO L413 NwaCegarLoop]: 2358 mSDtfsCounter, 1178 mSDsluCounter, 3563 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 5921 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:54:03,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 5921 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 15:54:03,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2022-11-16 15:54:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3884. [2022-11-16 15:54:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3884 states, 2840 states have (on average 1.9390845070422535) internal successors, (5507), 3859 states have internal predecessors, (5507), 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-11-16 15:54:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 5557 transitions. [2022-11-16 15:54:03,887 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 5557 transitions. Word has length 13 [2022-11-16 15:54:03,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:54:03,888 INFO L495 AbstractCegarLoop]: Abstraction has 3884 states and 5557 transitions. [2022-11-16 15:54:03,889 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-11-16 15:54:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 5557 transitions. [2022-11-16 15:54:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 15:54:03,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:54:03,891 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-11-16 15:54:03,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 15:54:04,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:04,108 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:54:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:54:04,108 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-11-16 15:54:04,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:54:04,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18249680] [2022-11-16 15:54:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:54:04,109 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-11-16 15:54:04,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:54:04,110 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:04,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:54:04,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 15:54:04,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:54:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:54:04,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:54:04,422 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:54:04,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18249680] [2022-11-16 15:54:04,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18249680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:54:04,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:54:04,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:54:04,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692880629] [2022-11-16 15:54:04,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:54:04,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 15:54:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:54:04,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 15:54:04,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 15:54:04,425 INFO L87 Difference]: Start difference. First operand 3884 states and 5557 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-11-16 15:54:04,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:54:04,525 INFO L93 Difference]: Finished difference Result 5509 states and 7308 transitions. [2022-11-16 15:54:04,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 15:54:04,525 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-11-16 15:54:04,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:54:04,537 INFO L225 Difference]: With dead ends: 5509 [2022-11-16 15:54:04,537 INFO L226 Difference]: Without dead ends: 5509 [2022-11-16 15:54:04,538 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-11-16 15:54:04,539 INFO L413 NwaCegarLoop]: 3864 mSDtfsCounter, 2284 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 5664 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-11-16 15:54:04,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2294 Valid, 5664 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 15:54:04,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2022-11-16 15:54:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 3824. [2022-11-16 15:54:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 2804 states have (on average 1.9333095577746078) internal successors, (5421), 3799 states have internal predecessors, (5421), 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-11-16 15:54:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 5471 transitions. [2022-11-16 15:54:04,610 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 5471 transitions. Word has length 20 [2022-11-16 15:54:04,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:54:04,610 INFO L495 AbstractCegarLoop]: Abstraction has 3824 states and 5471 transitions. [2022-11-16 15:54:04,610 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-11-16 15:54:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 5471 transitions. [2022-11-16 15:54:04,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 15:54:04,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:54:04,612 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-11-16 15:54:04,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-11-16 15:54:04,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:04,825 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:54:04,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:54:04,826 INFO L85 PathProgramCache]: Analyzing trace with hash 413623007, now seen corresponding path program 1 times [2022-11-16 15:54:04,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:54:04,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826142317] [2022-11-16 15:54:04,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:54:04,827 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-11-16 15:54:04,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:54:04,828 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:04,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:54:05,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 15:54:05,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:54:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:54:05,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:54:05,112 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:54:05,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826142317] [2022-11-16 15:54:05,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826142317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:54:05,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:54:05,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:54:05,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981745169] [2022-11-16 15:54:05,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:54:05,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 15:54:05,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:54:05,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 15:54:05,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 15:54:05,115 INFO L87 Difference]: Start difference. First operand 3824 states and 5471 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-11-16 15:54:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:54:05,186 INFO L93 Difference]: Finished difference Result 5342 states and 7017 transitions. [2022-11-16 15:54:05,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 15:54:05,187 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-11-16 15:54:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:54:05,199 INFO L225 Difference]: With dead ends: 5342 [2022-11-16 15:54:05,200 INFO L226 Difference]: Without dead ends: 5342 [2022-11-16 15:54:05,200 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-11-16 15:54:05,204 INFO L413 NwaCegarLoop]: 3774 mSDtfsCounter, 2241 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2251 SdHoareTripleChecker+Valid, 5526 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-11-16 15:54:05,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2251 Valid, 5526 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 15:54:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5342 states. [2022-11-16 15:54:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5342 to 3692. [2022-11-16 15:54:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 2696 states have (on average 1.915059347181009) internal successors, (5163), 3667 states have internal predecessors, (5163), 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-11-16 15:54:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 5213 transitions. [2022-11-16 15:54:05,291 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 5213 transitions. Word has length 20 [2022-11-16 15:54:05,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:54:05,292 INFO L495 AbstractCegarLoop]: Abstraction has 3692 states and 5213 transitions. [2022-11-16 15:54:05,292 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-11-16 15:54:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 5213 transitions. [2022-11-16 15:54:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 15:54:05,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:54:05,294 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-11-16 15:54:05,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 15:54:05,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:05,507 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:54:05,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:54:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-11-16 15:54:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:54:05,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183162475] [2022-11-16 15:54:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:54:05,509 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-11-16 15:54:05,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:54:05,510 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:05,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:54:05,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 15:54:05,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:54:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:54:05,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:54:05,816 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:54:05,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183162475] [2022-11-16 15:54:05,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183162475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:54:05,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:54:05,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:54:05,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584097384] [2022-11-16 15:54:05,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:54:05,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:54:05,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:54:05,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:54:05,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:54:05,818 INFO L87 Difference]: Start difference. First operand 3692 states and 5213 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-11-16 15:54:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:54:05,952 INFO L93 Difference]: Finished difference Result 5307 states and 6951 transitions. [2022-11-16 15:54:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 15:54:05,952 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-11-16 15:54:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:54:05,964 INFO L225 Difference]: With dead ends: 5307 [2022-11-16 15:54:05,964 INFO L226 Difference]: Without dead ends: 5307 [2022-11-16 15:54:05,965 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-11-16 15:54:05,965 INFO L413 NwaCegarLoop]: 3954 mSDtfsCounter, 2222 mSDsluCounter, 5704 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2232 SdHoareTripleChecker+Valid, 9658 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:54:05,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2232 Valid, 9658 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 15:54:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5307 states. [2022-11-16 15:54:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5307 to 3662. [2022-11-16 15:54:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 2680 states have (on average 1.9048507462686568) internal successors, (5105), 3637 states have internal predecessors, (5105), 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-11-16 15:54:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 5155 transitions. [2022-11-16 15:54:06,067 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 5155 transitions. Word has length 22 [2022-11-16 15:54:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:54:06,068 INFO L495 AbstractCegarLoop]: Abstraction has 3662 states and 5155 transitions. [2022-11-16 15:54:06,068 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-11-16 15:54:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 5155 transitions. [2022-11-16 15:54:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 15:54:06,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:54:06,069 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-11-16 15:54:06,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 15:54:06,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:06,282 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr358REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:54:06,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:54:06,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1940223495, now seen corresponding path program 1 times [2022-11-16 15:54:06,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:54:06,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553767855] [2022-11-16 15:54:06,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:54:06,283 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-11-16 15:54:06,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:54:06,284 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:06,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:54:06,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 15:54:06,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:54:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:54:06,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:54:06,553 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:54:06,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553767855] [2022-11-16 15:54:06,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553767855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:54:06,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:54:06,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:54:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247264718] [2022-11-16 15:54:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:54:06,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:54:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:54:06,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:54:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:54:06,555 INFO L87 Difference]: Start difference. First operand 3662 states and 5155 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-11-16 15:54:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:54:06,650 INFO L93 Difference]: Finished difference Result 5234 states and 6762 transitions. [2022-11-16 15:54:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 15:54:06,650 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-11-16 15:54:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:54:06,660 INFO L225 Difference]: With dead ends: 5234 [2022-11-16 15:54:06,661 INFO L226 Difference]: Without dead ends: 5234 [2022-11-16 15:54:06,661 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-11-16 15:54:06,662 INFO L413 NwaCegarLoop]: 3879 mSDtfsCounter, 2187 mSDsluCounter, 5589 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2197 SdHoareTripleChecker+Valid, 9468 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-11-16 15:54:06,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2197 Valid, 9468 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 15:54:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2022-11-16 15:54:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 3600. [2022-11-16 15:54:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3600 states, 2632 states have (on average 1.8734802431610942) internal successors, (4931), 3575 states have internal predecessors, (4931), 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-11-16 15:54:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 4981 transitions. [2022-11-16 15:54:06,760 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 4981 transitions. Word has length 22 [2022-11-16 15:54:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:54:06,762 INFO L495 AbstractCegarLoop]: Abstraction has 3600 states and 4981 transitions. [2022-11-16 15:54:06,762 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-11-16 15:54:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4981 transitions. [2022-11-16 15:54:06,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 15:54:06,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:54:06,764 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-11-16 15:54:06,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:06,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:06,980 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:54:06,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:54:06,980 INFO L85 PathProgramCache]: Analyzing trace with hash 558613821, now seen corresponding path program 1 times [2022-11-16 15:54:06,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:54:06,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199230927] [2022-11-16 15:54:06,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:54:06,981 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-11-16 15:54:06,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:54:06,982 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:07,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:54:07,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 15:54:07,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:54:07,262 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-11-16 15:54:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:54:07,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:54:07,344 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:54:07,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199230927] [2022-11-16 15:54:07,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199230927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:54:07,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:54:07,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:54:07,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656665354] [2022-11-16 15:54:07,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:54:07,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:54:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:54:07,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:54:07,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:54:07,347 INFO L87 Difference]: Start difference. First operand 3600 states and 4981 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-11-16 15:54:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:54:13,037 INFO L93 Difference]: Finished difference Result 4220 states and 5515 transitions. [2022-11-16 15:54:13,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 15:54:13,038 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-11-16 15:54:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:54:13,046 INFO L225 Difference]: With dead ends: 4220 [2022-11-16 15:54:13,046 INFO L226 Difference]: Without dead ends: 4220 [2022-11-16 15:54:13,047 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-11-16 15:54:13,047 INFO L413 NwaCegarLoop]: 1511 mSDtfsCounter, 3093 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3099 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-16 15:54:13,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3099 Valid, 2783 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-16 15:54:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2022-11-16 15:54:13,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 3596. [2022-11-16 15:54:13,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3596 states, 2632 states have (on average 1.8704407294832828) internal successors, (4923), 3571 states have internal predecessors, (4923), 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-11-16 15:54:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 4973 transitions. [2022-11-16 15:54:13,127 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 4973 transitions. Word has length 27 [2022-11-16 15:54:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:54:13,128 INFO L495 AbstractCegarLoop]: Abstraction has 3596 states and 4973 transitions. [2022-11-16 15:54:13,128 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-11-16 15:54:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 4973 transitions. [2022-11-16 15:54:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 15:54:13,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:54:13,128 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-11-16 15:54:13,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 15:54:13,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:13,329 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:54:13,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:54:13,330 INFO L85 PathProgramCache]: Analyzing trace with hash 558613822, now seen corresponding path program 1 times [2022-11-16 15:54:13,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:54:13,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251373919] [2022-11-16 15:54:13,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:54:13,330 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-11-16 15:54:13,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:54:13,332 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:13,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:54:13,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 15:54:13,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:54:13,603 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-11-16 15:54:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:54:13,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:54:13,794 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:54:13,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251373919] [2022-11-16 15:54:13,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251373919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:54:13,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:54:13,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:54:13,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188423360] [2022-11-16 15:54:13,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:54:13,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:54:13,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:54:13,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:54:13,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:54:13,795 INFO L87 Difference]: Start difference. First operand 3596 states and 4973 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-11-16 15:54:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:54:23,227 INFO L93 Difference]: Finished difference Result 4675 states and 6143 transitions. [2022-11-16 15:54:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 15:54:23,228 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-11-16 15:54:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:54:23,234 INFO L225 Difference]: With dead ends: 4675 [2022-11-16 15:54:23,234 INFO L226 Difference]: Without dead ends: 4675 [2022-11-16 15:54:23,234 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-11-16 15:54:23,235 INFO L413 NwaCegarLoop]: 1744 mSDtfsCounter, 2280 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2280 SdHoareTripleChecker+Valid, 4087 SdHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-11-16 15:54:23,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2280 Valid, 4087 Invalid, 2586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-11-16 15:54:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4675 states. [2022-11-16 15:54:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4675 to 3632. [2022-11-16 15:54:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3632 states, 2668 states have (on average 1.8605697151424287) internal successors, (4964), 3607 states have internal predecessors, (4964), 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-11-16 15:54:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 5014 transitions. [2022-11-16 15:54:23,293 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 5014 transitions. Word has length 27 [2022-11-16 15:54:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:54:23,293 INFO L495 AbstractCegarLoop]: Abstraction has 3632 states and 5014 transitions. [2022-11-16 15:54:23,293 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-11-16 15:54:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 5014 transitions. [2022-11-16 15:54:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 15:54:23,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:54:23,295 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-11-16 15:54:23,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-16 15:54:23,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:23,506 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:54:23,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:54:23,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-11-16 15:54:23,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:54:23,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897257696] [2022-11-16 15:54:23,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:54:23,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 15:54:23,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:54:23,509 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:23,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:54:23,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 15:54:23,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:54:23,805 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-11-16 15:54:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:54:23,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:54:23,901 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:54:23,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897257696] [2022-11-16 15:54:23,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897257696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:54:23,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:54:23,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:54:23,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680639454] [2022-11-16 15:54:23,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:54:23,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:54:23,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:54:23,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:54:23,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:54:23,904 INFO L87 Difference]: Start difference. First operand 3632 states and 5014 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-11-16 15:54:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:54:32,434 INFO L93 Difference]: Finished difference Result 7027 states and 9544 transitions. [2022-11-16 15:54:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 15:54:32,435 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-11-16 15:54:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:54:32,444 INFO L225 Difference]: With dead ends: 7027 [2022-11-16 15:54:32,444 INFO L226 Difference]: Without dead ends: 7027 [2022-11-16 15:54:32,444 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-11-16 15:54:32,445 INFO L413 NwaCegarLoop]: 2706 mSDtfsCounter, 4281 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 3162 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4288 SdHoareTripleChecker+Valid, 5103 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-16 15:54:32,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4288 Valid, 5103 Invalid, 3205 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 3162 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-11-16 15:54:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7027 states. [2022-11-16 15:54:32,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7027 to 3628. [2022-11-16 15:54:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3628 states, 2668 states have (on average 1.8575712143928036) internal successors, (4956), 3603 states have internal predecessors, (4956), 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-11-16 15:54:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 5006 transitions. [2022-11-16 15:54:32,517 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 5006 transitions. Word has length 36 [2022-11-16 15:54:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:54:32,517 INFO L495 AbstractCegarLoop]: Abstraction has 3628 states and 5006 transitions. [2022-11-16 15:54:32,517 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-11-16 15:54:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 5006 transitions. [2022-11-16 15:54:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 15:54:32,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:54:32,518 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-11-16 15:54:32,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-16 15:54:32,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:32,732 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:54:32,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:54:32,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-11-16 15:54:32,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:54:32,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482755211] [2022-11-16 15:54:32,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:54:32,735 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-11-16 15:54:32,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:54:32,736 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:32,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:54:33,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 15:54:33,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:54:33,091 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-11-16 15:54:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:54:33,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:54:33,318 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:54:33,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482755211] [2022-11-16 15:54:33,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482755211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:54:33,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:54:33,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:54:33,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492525843] [2022-11-16 15:54:33,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:54:33,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:54:33,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:54:33,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:54:33,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:54:33,320 INFO L87 Difference]: Start difference. First operand 3628 states and 5006 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-11-16 15:54:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:54:45,827 INFO L93 Difference]: Finished difference Result 6721 states and 8949 transitions. [2022-11-16 15:54:45,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 15:54:45,828 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-11-16 15:54:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:54:45,836 INFO L225 Difference]: With dead ends: 6721 [2022-11-16 15:54:45,836 INFO L226 Difference]: Without dead ends: 6721 [2022-11-16 15:54:45,837 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-11-16 15:54:45,837 INFO L413 NwaCegarLoop]: 3191 mSDtfsCounter, 2831 mSDsluCounter, 2888 mSDsCounter, 0 mSdLazyCounter, 3485 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2835 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 3497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-11-16 15:54:45,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2835 Valid, 6079 Invalid, 3497 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 3485 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2022-11-16 15:54:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6721 states. [2022-11-16 15:54:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6721 to 3624. [2022-11-16 15:54:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 2668 states have (on average 1.8545727136431784) internal successors, (4948), 3599 states have internal predecessors, (4948), 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-11-16 15:54:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 4998 transitions. [2022-11-16 15:54:45,906 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 4998 transitions. Word has length 36 [2022-11-16 15:54:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:54:45,907 INFO L495 AbstractCegarLoop]: Abstraction has 3624 states and 4998 transitions. [2022-11-16 15:54:45,907 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-11-16 15:54:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 4998 transitions. [2022-11-16 15:54:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 15:54:45,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:54:45,908 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-11-16 15:54:45,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:46,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:46,121 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:54:46,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:54:46,122 INFO L85 PathProgramCache]: Analyzing trace with hash -775407193, now seen corresponding path program 1 times [2022-11-16 15:54:46,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:54:46,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104919187] [2022-11-16 15:54:46,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:54:46,123 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-11-16 15:54:46,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:54:46,124 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:46,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:54:46,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 15:54:46,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:54:46,449 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-11-16 15:54:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:54:46,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:54:46,554 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:54:46,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104919187] [2022-11-16 15:54:46,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104919187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:54:46,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:54:46,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:54:46,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911646740] [2022-11-16 15:54:46,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:54:46,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:54:46,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:54:46,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:54:46,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:54:46,555 INFO L87 Difference]: Start difference. First operand 3624 states and 4998 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-11-16 15:54:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:54:55,789 INFO L93 Difference]: Finished difference Result 7470 states and 10054 transitions. [2022-11-16 15:54:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 15:54:55,790 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-11-16 15:54:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:54:55,800 INFO L225 Difference]: With dead ends: 7470 [2022-11-16 15:54:55,800 INFO L226 Difference]: Without dead ends: 7470 [2022-11-16 15:54:55,800 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-11-16 15:54:55,801 INFO L413 NwaCegarLoop]: 2536 mSDtfsCounter, 4851 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4861 SdHoareTripleChecker+Valid, 5123 SdHoareTripleChecker+Invalid, 3393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:54:55,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4861 Valid, 5123 Invalid, 3393 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [51 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-11-16 15:54:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2022-11-16 15:54:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 3621. [2022-11-16 15:54:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 2668 states have (on average 1.8463268365817092) internal successors, (4926), 3596 states have internal predecessors, (4926), 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-11-16 15:54:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 4976 transitions. [2022-11-16 15:54:55,867 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 4976 transitions. Word has length 36 [2022-11-16 15:54:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:54:55,868 INFO L495 AbstractCegarLoop]: Abstraction has 3621 states and 4976 transitions. [2022-11-16 15:54:55,868 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-11-16 15:54:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 4976 transitions. [2022-11-16 15:54:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 15:54:55,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:54:55,869 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-11-16 15:54:55,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 15:54:56,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:56,082 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:54:56,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:54:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash -775407192, now seen corresponding path program 1 times [2022-11-16 15:54:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:54:56,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388618685] [2022-11-16 15:54:56,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:54:56,084 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-11-16 15:54:56,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:54:56,085 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:56,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:54:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:54:56,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 15:54:56,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:54:56,420 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-11-16 15:54:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:54:56,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:54:56,670 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:54:56,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388618685] [2022-11-16 15:54:56,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388618685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:54:56,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:54:56,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:54:56,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634749719] [2022-11-16 15:54:56,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:54:56,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:54:56,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:54:56,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:54:56,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:54:56,672 INFO L87 Difference]: Start difference. First operand 3621 states and 4976 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-11-16 15:55:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:55:07,205 INFO L93 Difference]: Finished difference Result 5557 states and 7335 transitions. [2022-11-16 15:55:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 15:55:07,206 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-11-16 15:55:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:55:07,211 INFO L225 Difference]: With dead ends: 5557 [2022-11-16 15:55:07,211 INFO L226 Difference]: Without dead ends: 5557 [2022-11-16 15:55:07,211 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-11-16 15:55:07,212 INFO L413 NwaCegarLoop]: 2836 mSDtfsCounter, 2602 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 2991 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2602 SdHoareTripleChecker+Valid, 5297 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-11-16 15:55:07,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2602 Valid, 5297 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2991 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-11-16 15:55:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2022-11-16 15:55:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 3621. [2022-11-16 15:55:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 2668 states have (on average 1.843328335832084) internal successors, (4918), 3596 states have internal predecessors, (4918), 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-11-16 15:55:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 4968 transitions. [2022-11-16 15:55:07,270 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 4968 transitions. Word has length 36 [2022-11-16 15:55:07,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:55:07,271 INFO L495 AbstractCegarLoop]: Abstraction has 3621 states and 4968 transitions. [2022-11-16 15:55:07,271 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-11-16 15:55:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 4968 transitions. [2022-11-16 15:55:07,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 15:55:07,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:55:07,272 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-11-16 15:55:07,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-16 15:55:07,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:07,485 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:55:07,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:55:07,486 INFO L85 PathProgramCache]: Analyzing trace with hash -715750141, now seen corresponding path program 1 times [2022-11-16 15:55:07,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:55:07,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626389435] [2022-11-16 15:55:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:55:07,486 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-11-16 15:55:07,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:55:07,488 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:07,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:55:07,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 15:55:07,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:55:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:55:07,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:55:07,832 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:55:07,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626389435] [2022-11-16 15:55:07,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626389435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:55:07,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:55:07,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:55:07,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3145012] [2022-11-16 15:55:07,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:55:07,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:55:07,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:55:07,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:55:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:55:07,835 INFO L87 Difference]: Start difference. First operand 3621 states and 4968 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-11-16 15:55:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:55:07,922 INFO L93 Difference]: Finished difference Result 3609 states and 4944 transitions. [2022-11-16 15:55:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 15:55:07,922 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-11-16 15:55:07,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:55:07,927 INFO L225 Difference]: With dead ends: 3609 [2022-11-16 15:55:07,927 INFO L226 Difference]: Without dead ends: 3609 [2022-11-16 15:55:07,927 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-11-16 15:55:07,928 INFO L413 NwaCegarLoop]: 2189 mSDtfsCounter, 1155 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 5402 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-11-16 15:55:07,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 5402 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 15:55:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2022-11-16 15:55:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 3609. [2022-11-16 15:55:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3609 states, 2656 states have (on average 1.8426204819277108) internal successors, (4894), 3584 states have internal predecessors, (4894), 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-11-16 15:55:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 4944 transitions. [2022-11-16 15:55:07,975 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 4944 transitions. Word has length 40 [2022-11-16 15:55:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:55:07,975 INFO L495 AbstractCegarLoop]: Abstraction has 3609 states and 4944 transitions. [2022-11-16 15:55:07,976 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-11-16 15:55:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 4944 transitions. [2022-11-16 15:55:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 15:55:07,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:55:07,977 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-11-16 15:55:07,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-16 15:55:08,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:08,189 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:55:08,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:55:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1005839671, now seen corresponding path program 1 times [2022-11-16 15:55:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:55:08,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368168500] [2022-11-16 15:55:08,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:55:08,190 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-11-16 15:55:08,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:55:08,192 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:08,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:55:08,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 15:55:08,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:55:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:55:08,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:55:08,784 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:55:08,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368168500] [2022-11-16 15:55:08,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368168500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:55:08,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:55:08,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:55:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608005238] [2022-11-16 15:55:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:55:08,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 15:55:08,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:55:08,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 15:55:08,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 15:55:08,785 INFO L87 Difference]: Start difference. First operand 3609 states and 4944 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-11-16 15:55:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:55:09,257 INFO L93 Difference]: Finished difference Result 5428 states and 7151 transitions. [2022-11-16 15:55:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 15:55:09,258 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-11-16 15:55:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:55:09,262 INFO L225 Difference]: With dead ends: 5428 [2022-11-16 15:55:09,262 INFO L226 Difference]: Without dead ends: 5428 [2022-11-16 15:55:09,262 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-11-16 15:55:09,263 INFO L413 NwaCegarLoop]: 2277 mSDtfsCounter, 1566 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 15:55:09,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1575 Valid, 4312 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 15:55:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5428 states. [2022-11-16 15:55:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5428 to 4625. [2022-11-16 15:55:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 3665 states have (on average 1.8256480218281037) internal successors, (6691), 4590 states have internal predecessors, (6691), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-16 15:55:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 6761 transitions. [2022-11-16 15:55:09,325 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 6761 transitions. Word has length 48 [2022-11-16 15:55:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:55:09,326 INFO L495 AbstractCegarLoop]: Abstraction has 4625 states and 6761 transitions. [2022-11-16 15:55:09,326 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-11-16 15:55:09,326 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 6761 transitions. [2022-11-16 15:55:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 15:55:09,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:55:09,327 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-11-16 15:55:09,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:09,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:09,540 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:55:09,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:55:09,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1815084135, now seen corresponding path program 1 times [2022-11-16 15:55:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:55:09,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199260518] [2022-11-16 15:55:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:55:09,541 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-11-16 15:55:09,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:55:09,542 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:09,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:55:09,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 15:55:09,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:55:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:55:09,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:55:09,987 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:55:09,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199260518] [2022-11-16 15:55:09,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199260518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:55:09,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:55:09,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:55:09,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093853549] [2022-11-16 15:55:09,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:55:09,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:55:09,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:55:09,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:55:09,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:55:09,989 INFO L87 Difference]: Start difference. First operand 4625 states and 6761 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-11-16 15:55:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:55:10,107 INFO L93 Difference]: Finished difference Result 5936 states and 8133 transitions. [2022-11-16 15:55:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 15:55:10,108 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-11-16 15:55:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:55:10,157 INFO L225 Difference]: With dead ends: 5936 [2022-11-16 15:55:10,157 INFO L226 Difference]: Without dead ends: 5936 [2022-11-16 15:55:10,157 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-11-16 15:55:10,158 INFO L413 NwaCegarLoop]: 3648 mSDtfsCounter, 2150 mSDsluCounter, 5129 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 8777 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:55:10,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 8777 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 15:55:10,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5936 states. [2022-11-16 15:55:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5936 to 4583. [2022-11-16 15:55:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4583 states, 3623 states have (on average 1.8274910295335358) internal successors, (6621), 4548 states have internal predecessors, (6621), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-16 15:55:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 6691 transitions. [2022-11-16 15:55:10,222 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 6691 transitions. Word has length 51 [2022-11-16 15:55:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:55:10,222 INFO L495 AbstractCegarLoop]: Abstraction has 4583 states and 6691 transitions. [2022-11-16 15:55:10,222 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-11-16 15:55:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 6691 transitions. [2022-11-16 15:55:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 15:55:10,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:55:10,223 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-11-16 15:55:10,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 15:55:10,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:10,447 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:55:10,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:55:10,448 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-11-16 15:55:10,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:55:10,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939837363] [2022-11-16 15:55:10,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:55:10,449 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-11-16 15:55:10,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:55:10,450 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:10,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:55:10,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 15:55:10,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:55:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:55:10,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:55:10,909 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:55:10,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939837363] [2022-11-16 15:55:10,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939837363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:55:10,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:55:10,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:55:10,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035497772] [2022-11-16 15:55:10,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:55:10,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:55:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:55:10,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:55:10,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:55:10,911 INFO L87 Difference]: Start difference. First operand 4583 states and 6691 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-11-16 15:55:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:55:11,068 INFO L93 Difference]: Finished difference Result 5673 states and 7621 transitions. [2022-11-16 15:55:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 15:55:11,069 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-11-16 15:55:11,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:55:11,075 INFO L225 Difference]: With dead ends: 5673 [2022-11-16 15:55:11,076 INFO L226 Difference]: Without dead ends: 5673 [2022-11-16 15:55:11,076 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-11-16 15:55:11,077 INFO L413 NwaCegarLoop]: 3688 mSDtfsCounter, 2141 mSDsluCounter, 5218 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2151 SdHoareTripleChecker+Valid, 8906 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:55:11,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2151 Valid, 8906 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 15:55:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2022-11-16 15:55:11,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 4565. [2022-11-16 15:55:11,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4565 states, 3605 states have (on average 1.8282940360610263) internal successors, (6591), 4530 states have internal predecessors, (6591), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-16 15:55:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 6661 transitions. [2022-11-16 15:55:11,137 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 6661 transitions. Word has length 54 [2022-11-16 15:55:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:55:11,138 INFO L495 AbstractCegarLoop]: Abstraction has 4565 states and 6661 transitions. [2022-11-16 15:55:11,138 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-11-16 15:55:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 6661 transitions. [2022-11-16 15:55:11,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 15:55:11,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:55:11,139 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-11-16 15:55:11,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:11,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:11,353 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:55:11,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:55:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1638755906, now seen corresponding path program 1 times [2022-11-16 15:55:11,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:55:11,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590547826] [2022-11-16 15:55:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:55:11,355 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-11-16 15:55:11,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:55:11,357 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:11,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:55:11,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 15:55:11,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:55:11,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 15:55:11,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 15:55:11,784 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-11-16 15:55:11,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 15:55:11,836 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-11-16 15:55:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:55:11,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:55:11,880 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:55:11,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590547826] [2022-11-16 15:55:11,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590547826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:55:11,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:55:11,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:55:11,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127891145] [2022-11-16 15:55:11,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:55:11,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:55:11,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:55:11,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:55:11,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:55:11,882 INFO L87 Difference]: Start difference. First operand 4565 states and 6661 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-11-16 15:55:14,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:55:14,576 INFO L93 Difference]: Finished difference Result 4792 states and 6899 transitions. [2022-11-16 15:55:14,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 15:55:14,578 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-11-16 15:55:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:55:14,586 INFO L225 Difference]: With dead ends: 4792 [2022-11-16 15:55:14,586 INFO L226 Difference]: Without dead ends: 4792 [2022-11-16 15:55:14,586 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-11-16 15:55:14,587 INFO L413 NwaCegarLoop]: 2067 mSDtfsCounter, 1031 mSDsluCounter, 3311 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 5378 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-16 15:55:14,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 5378 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 132 Unchecked, 2.6s Time] [2022-11-16 15:55:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2022-11-16 15:55:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4531. [2022-11-16 15:55:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4531 states, 3571 states have (on average 1.8359003080369645) internal successors, (6556), 4496 states have internal predecessors, (6556), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-16 15:55:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6626 transitions. [2022-11-16 15:55:14,644 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6626 transitions. Word has length 57 [2022-11-16 15:55:14,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:55:14,644 INFO L495 AbstractCegarLoop]: Abstraction has 4531 states and 6626 transitions. [2022-11-16 15:55:14,644 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-11-16 15:55:14,644 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6626 transitions. [2022-11-16 15:55:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 15:55:14,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:55:14,645 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-11-16 15:55:14,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:14,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:14,859 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:55:14,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:55:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2076762779, now seen corresponding path program 1 times [2022-11-16 15:55:14,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:55:14,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203137093] [2022-11-16 15:55:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:55:14,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 15:55:14,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:55:14,862 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:14,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:55:15,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 15:55:15,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:55:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:55:15,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:55:15,617 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:55:15,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203137093] [2022-11-16 15:55:15,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203137093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:55:15,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:55:15,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:55:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724957040] [2022-11-16 15:55:15,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:55:15,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 15:55:15,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:55:15,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 15:55:15,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 15:55:15,619 INFO L87 Difference]: Start difference. First operand 4531 states and 6626 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-11-16 15:55:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:55:15,848 INFO L93 Difference]: Finished difference Result 6332 states and 8900 transitions. [2022-11-16 15:55:15,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 15:55:15,849 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-11-16 15:55:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:55:15,859 INFO L225 Difference]: With dead ends: 6332 [2022-11-16 15:55:15,859 INFO L226 Difference]: Without dead ends: 6332 [2022-11-16 15:55:15,860 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-11-16 15:55:15,865 INFO L413 NwaCegarLoop]: 2340 mSDtfsCounter, 1264 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 4405 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 15:55:15,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 4405 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 15:55:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6332 states. [2022-11-16 15:55:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6332 to 5603. [2022-11-16 15:55:15,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5603 states, 4635 states have (on average 1.8101402373247033) internal successors, (8390), 5557 states have internal predecessors, (8390), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-16 15:55:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5603 states to 5603 states and 8482 transitions. [2022-11-16 15:55:15,941 INFO L78 Accepts]: Start accepts. Automaton has 5603 states and 8482 transitions. Word has length 59 [2022-11-16 15:55:15,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:55:15,941 INFO L495 AbstractCegarLoop]: Abstraction has 5603 states and 8482 transitions. [2022-11-16 15:55:15,942 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-11-16 15:55:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 5603 states and 8482 transitions. [2022-11-16 15:55:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 15:55:15,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:55:15,943 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-11-16 15:55:15,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 15:55:16,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:16,157 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:55:16,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:55:16,157 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-11-16 15:55:16,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:55:16,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005538096] [2022-11-16 15:55:16,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:55:16,158 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-11-16 15:55:16,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:55:16,161 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:16,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:55:16,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 15:55:16,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:55:16,721 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-11-16 15:55:16,729 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-11-16 15:55:17,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 15:55:17,311 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-11-16 15:55:17,327 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 15:55:17,327 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-11-16 15:55:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:55:17,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:55:17,342 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:55:17,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005538096] [2022-11-16 15:55:17,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005538096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:55:17,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:55:17,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:55:17,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418823305] [2022-11-16 15:55:17,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:55:17,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:55:17,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:55:17,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:55:17,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:55:17,343 INFO L87 Difference]: Start difference. First operand 5603 states and 8482 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-11-16 15:55:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:55:24,544 INFO L93 Difference]: Finished difference Result 8022 states and 12205 transitions. [2022-11-16 15:55:24,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 15:55:24,545 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-11-16 15:55:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:55:24,554 INFO L225 Difference]: With dead ends: 8022 [2022-11-16 15:55:24,554 INFO L226 Difference]: Without dead ends: 8022 [2022-11-16 15:55:24,554 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-11-16 15:55:24,555 INFO L413 NwaCegarLoop]: 1035 mSDtfsCounter, 4063 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4077 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:55:24,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4077 Valid, 1639 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-11-16 15:55:24,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8022 states. [2022-11-16 15:55:24,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8022 to 5363. [2022-11-16 15:55:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5363 states, 4479 states have (on average 1.7434695244474212) internal successors, (7809), 5317 states have internal predecessors, (7809), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-16 15:55:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5363 states to 5363 states and 7901 transitions. [2022-11-16 15:55:24,632 INFO L78 Accepts]: Start accepts. Automaton has 5363 states and 7901 transitions. Word has length 62 [2022-11-16 15:55:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:55:24,632 INFO L495 AbstractCegarLoop]: Abstraction has 5363 states and 7901 transitions. [2022-11-16 15:55:24,632 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-11-16 15:55:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 5363 states and 7901 transitions. [2022-11-16 15:55:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 15:55:24,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:55:24,648 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-11-16 15:55:24,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-16 15:55:24,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:24,863 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:55:24,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:55:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-11-16 15:55:24,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:55:24,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259643881] [2022-11-16 15:55:24,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:55:24,865 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-11-16 15:55:24,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:55:24,867 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:24,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:55:25,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 15:55:25,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:55:25,268 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-11-16 15:55:25,281 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-11-16 15:55:25,332 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-11-16 15:55:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:55:25,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:55:25,343 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:55:25,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259643881] [2022-11-16 15:55:25,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259643881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:55:25,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:55:25,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:55:25,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626990396] [2022-11-16 15:55:25,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:55:25,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 15:55:25,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:55:25,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 15:55:25,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 15:55:25,346 INFO L87 Difference]: Start difference. First operand 5363 states and 7901 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-11-16 15:55:32,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:55:32,168 INFO L93 Difference]: Finished difference Result 5362 states and 7898 transitions. [2022-11-16 15:55:32,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 15:55:32,168 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-11-16 15:55:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:55:32,174 INFO L225 Difference]: With dead ends: 5362 [2022-11-16 15:55:32,174 INFO L226 Difference]: Without dead ends: 5362 [2022-11-16 15:55:32,175 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-11-16 15:55:32,175 INFO L413 NwaCegarLoop]: 2108 mSDtfsCounter, 4 mSDsluCounter, 3446 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5554 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-16 15:55:32,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5554 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-11-16 15:55:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2022-11-16 15:55:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 5362. [2022-11-16 15:55:32,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5362 states, 4479 states have (on average 1.7427997320830542) internal successors, (7806), 5316 states have internal predecessors, (7806), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-16 15:55:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5362 states to 5362 states and 7898 transitions. [2022-11-16 15:55:32,241 INFO L78 Accepts]: Start accepts. Automaton has 5362 states and 7898 transitions. Word has length 67 [2022-11-16 15:55:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:55:32,241 INFO L495 AbstractCegarLoop]: Abstraction has 5362 states and 7898 transitions. [2022-11-16 15:55:32,241 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-11-16 15:55:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 5362 states and 7898 transitions. [2022-11-16 15:55:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 15:55:32,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:55:32,242 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-11-16 15:55:32,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 15:55:32,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:32,451 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:55:32,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:55:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-11-16 15:55:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:55:32,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381683460] [2022-11-16 15:55:32,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:55:32,453 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-11-16 15:55:32,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:55:32,454 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:32,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:55:32,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 15:55:32,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:55:32,881 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-11-16 15:55:32,904 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-11-16 15:55:32,917 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-11-16 15:55:32,974 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-11-16 15:55:32,982 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-11-16 15:55:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:55:33,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:55:33,004 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:55:33,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381683460] [2022-11-16 15:55:33,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381683460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:55:33,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:55:33,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:55:33,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299648481] [2022-11-16 15:55:33,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:55:33,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 15:55:33,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:55:33,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 15:55:33,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 15:55:33,006 INFO L87 Difference]: Start difference. First operand 5362 states and 7898 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-11-16 15:55:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:55:41,835 INFO L93 Difference]: Finished difference Result 5361 states and 7895 transitions. [2022-11-16 15:55:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 15:55:41,836 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-11-16 15:55:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:55:41,842 INFO L225 Difference]: With dead ends: 5361 [2022-11-16 15:55:41,842 INFO L226 Difference]: Without dead ends: 5361 [2022-11-16 15:55:41,842 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-11-16 15:55:41,842 INFO L413 NwaCegarLoop]: 2108 mSDtfsCounter, 2 mSDsluCounter, 3447 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5555 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-16 15:55:41,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5555 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-11-16 15:55:41,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5361 states. [2022-11-16 15:55:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5361 to 5361. [2022-11-16 15:55:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5361 states, 4476 states have (on average 1.7432975871313674) internal successors, (7803), 5315 states have internal predecessors, (7803), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-16 15:55:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5361 states to 5361 states and 7895 transitions. [2022-11-16 15:55:41,901 INFO L78 Accepts]: Start accepts. Automaton has 5361 states and 7895 transitions. Word has length 67 [2022-11-16 15:55:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:55:41,901 INFO L495 AbstractCegarLoop]: Abstraction has 5361 states and 7895 transitions. [2022-11-16 15:55:41,901 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-11-16 15:55:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 5361 states and 7895 transitions. [2022-11-16 15:55:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 15:55:41,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:55:41,903 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-11-16 15:55:41,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 15:55:42,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:42,104 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:55:42,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:55:42,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017746, now seen corresponding path program 1 times [2022-11-16 15:55:42,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:55:42,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570411154] [2022-11-16 15:55:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:55:42,105 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-11-16 15:55:42,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:55:42,106 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:42,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:55:42,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 15:55:42,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:55:42,566 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-11-16 15:55:42,579 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-11-16 15:55:42,607 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-11-16 15:55:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:55:42,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:55:42,618 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:55:42,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570411154] [2022-11-16 15:55:42,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570411154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:55:42,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:55:42,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:55:42,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366764332] [2022-11-16 15:55:42,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:55:42,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 15:55:42,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:55:42,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 15:55:42,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 15:55:42,620 INFO L87 Difference]: Start difference. First operand 5361 states and 7895 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-11-16 15:55:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:55:48,957 INFO L93 Difference]: Finished difference Result 5360 states and 7891 transitions. [2022-11-16 15:55:48,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 15:55:48,959 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-11-16 15:55:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:55:48,964 INFO L225 Difference]: With dead ends: 5360 [2022-11-16 15:55:48,965 INFO L226 Difference]: Without dead ends: 5360 [2022-11-16 15:55:48,965 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-11-16 15:55:48,965 INFO L413 NwaCegarLoop]: 2106 mSDtfsCounter, 4 mSDsluCounter, 3443 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5549 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-16 15:55:48,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5549 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-16 15:55:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5360 states. [2022-11-16 15:55:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5360 to 5360. [2022-11-16 15:55:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5360 states, 4476 states have (on average 1.7424039320822162) internal successors, (7799), 5314 states have internal predecessors, (7799), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-16 15:55:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5360 states to 5360 states and 7891 transitions. [2022-11-16 15:55:49,023 INFO L78 Accepts]: Start accepts. Automaton has 5360 states and 7891 transitions. Word has length 67 [2022-11-16 15:55:49,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:55:49,024 INFO L495 AbstractCegarLoop]: Abstraction has 5360 states and 7891 transitions. [2022-11-16 15:55:49,024 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-11-16 15:55:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5360 states and 7891 transitions. [2022-11-16 15:55:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 15:55:49,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:55:49,025 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-11-16 15:55:49,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-16 15:55:49,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:49,240 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:55:49,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:55:49,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017745, now seen corresponding path program 1 times [2022-11-16 15:55:49,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:55:49,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842092918] [2022-11-16 15:55:49,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:55:49,241 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-11-16 15:55:49,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:55:49,242 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:49,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:55:49,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 15:55:49,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:55:49,752 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-11-16 15:55:49,785 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-11-16 15:55:49,798 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-11-16 15:55:49,859 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-11-16 15:55:49,866 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-11-16 15:55:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:55:49,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:55:49,885 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:55:49,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842092918] [2022-11-16 15:55:49,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842092918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:55:49,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:55:49,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:55:49,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911820811] [2022-11-16 15:55:49,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:55:49,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 15:55:49,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:55:49,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 15:55:49,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 15:55:49,886 INFO L87 Difference]: Start difference. First operand 5360 states and 7891 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-11-16 15:55:58,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:55:58,673 INFO L93 Difference]: Finished difference Result 5359 states and 7887 transitions. [2022-11-16 15:55:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 15:55:58,674 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-11-16 15:55:58,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:55:58,679 INFO L225 Difference]: With dead ends: 5359 [2022-11-16 15:55:58,679 INFO L226 Difference]: Without dead ends: 5359 [2022-11-16 15:55:58,679 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-11-16 15:55:58,680 INFO L413 NwaCegarLoop]: 2106 mSDtfsCounter, 2 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5550 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-16 15:55:58,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5550 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-11-16 15:55:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5359 states. [2022-11-16 15:55:58,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5359 to 5359. [2022-11-16 15:55:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5359 states, 4472 states have (on average 1.743067978533095) internal successors, (7795), 5313 states have internal predecessors, (7795), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-16 15:55:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5359 states to 5359 states and 7887 transitions. [2022-11-16 15:55:58,755 INFO L78 Accepts]: Start accepts. Automaton has 5359 states and 7887 transitions. Word has length 67 [2022-11-16 15:55:58,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:55:58,756 INFO L495 AbstractCegarLoop]: Abstraction has 5359 states and 7887 transitions. [2022-11-16 15:55:58,756 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-11-16 15:55:58,756 INFO L276 IsEmpty]: Start isEmpty. Operand 5359 states and 7887 transitions. [2022-11-16 15:55:58,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 15:55:58,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:55:58,757 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-11-16 15:55:58,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:58,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:58,973 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:55:58,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:55:58,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1457804367, now seen corresponding path program 1 times [2022-11-16 15:55:58,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:55:58,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412981887] [2022-11-16 15:55:58,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:55:58,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 15:55:58,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:55:58,975 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:58,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:55:59,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 15:55:59,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:55:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:55:59,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:55:59,454 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:55:59,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412981887] [2022-11-16 15:55:59,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412981887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:55:59,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:55:59,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:55:59,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224546012] [2022-11-16 15:55:59,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:55:59,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:55:59,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:55:59,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:55:59,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:55:59,457 INFO L87 Difference]: Start difference. First operand 5359 states and 7887 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-11-16 15:55:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:55:59,556 INFO L93 Difference]: Finished difference Result 5362 states and 7896 transitions. [2022-11-16 15:55:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 15:55:59,557 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-11-16 15:55:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:55:59,569 INFO L225 Difference]: With dead ends: 5362 [2022-11-16 15:55:59,570 INFO L226 Difference]: Without dead ends: 5362 [2022-11-16 15:55:59,570 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-11-16 15:55:59,571 INFO L413 NwaCegarLoop]: 2105 mSDtfsCounter, 2 mSDsluCounter, 4202 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6307 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:55:59,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6307 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 15:55:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2022-11-16 15:55:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 5362. [2022-11-16 15:55:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5362 states, 4474 states have (on average 1.7429593205185516) internal successors, (7798), 5316 states have internal predecessors, (7798), 46 states have call successors, (46), 3 states have call predecessors, (46), 4 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-16 15:55:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5362 states to 5362 states and 7896 transitions. [2022-11-16 15:55:59,647 INFO L78 Accepts]: Start accepts. Automaton has 5362 states and 7896 transitions. Word has length 75 [2022-11-16 15:55:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:55:59,648 INFO L495 AbstractCegarLoop]: Abstraction has 5362 states and 7896 transitions. [2022-11-16 15:55:59,648 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-11-16 15:55:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 5362 states and 7896 transitions. [2022-11-16 15:55:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-16 15:55:59,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:55:59,649 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-11-16 15:55:59,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 15:55:59,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:59,864 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:55:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:55:59,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1162843208, now seen corresponding path program 1 times [2022-11-16 15:55:59,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:55:59,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24497048] [2022-11-16 15:55:59,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:55:59,865 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-11-16 15:55:59,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:55:59,866 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:55:59,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:56:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:56:00,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 15:56:00,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:56:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:00,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:56:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:00,435 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:56:00,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24497048] [2022-11-16 15:56:00,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24497048] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 15:56:00,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [34262580] [2022-11-16 15:56:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:56:00,436 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 15:56:00,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 15:56:00,443 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 15:56:00,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-16 15:56:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:56:01,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 15:56:01,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:56:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:01,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:56:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:01,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [34262580] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 15:56:01,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993230206] [2022-11-16 15:56:01,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:56:01,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 15:56:01,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 15:56:01,304 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 15:56:01,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-16 15:56:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:56:01,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 15:56:01,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:56:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:01,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:56:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:01,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993230206] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 15:56:01,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-16 15:56:01,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-16 15:56:01,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976863169] [2022-11-16 15:56:01,863 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-16 15:56:01,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 15:56:01,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:56:01,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 15:56:01,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 15:56:01,864 INFO L87 Difference]: Start difference. First operand 5362 states and 7896 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-11-16 15:56:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:56:02,170 INFO L93 Difference]: Finished difference Result 5374 states and 7918 transitions. [2022-11-16 15:56:02,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 15:56:02,171 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-11-16 15:56:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:56:02,181 INFO L225 Difference]: With dead ends: 5374 [2022-11-16 15:56:02,181 INFO L226 Difference]: Without dead ends: 5374 [2022-11-16 15:56:02,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-16 15:56:02,183 INFO L413 NwaCegarLoop]: 2105 mSDtfsCounter, 17 mSDsluCounter, 6301 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 8406 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 15:56:02,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 8406 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 15:56:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5374 states. [2022-11-16 15:56:02,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5374 to 5372. [2022-11-16 15:56:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5372 states, 4483 states have (on average 1.7428061565915682) internal successors, (7813), 5325 states have internal predecessors, (7813), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-16 15:56:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 7911 transitions. [2022-11-16 15:56:02,260 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 7911 transitions. Word has length 76 [2022-11-16 15:56:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:56:02,260 INFO L495 AbstractCegarLoop]: Abstraction has 5372 states and 7911 transitions. [2022-11-16 15:56:02,260 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-11-16 15:56:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 7911 transitions. [2022-11-16 15:56:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-16 15:56:02,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:56:02,262 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-11-16 15:56:02,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-16 15:56:02,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-16 15:56:02,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:56:02,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:56:02,873 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:56:02,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:56:02,874 INFO L85 PathProgramCache]: Analyzing trace with hash 934349455, now seen corresponding path program 2 times [2022-11-16 15:56:02,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:56:02,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177414804] [2022-11-16 15:56:02,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 15:56:02,874 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-11-16 15:56:02,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:56:02,876 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:56:02,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:56:03,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 15:56:03,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 15:56:03,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 15:56:03,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:56:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:03,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:56:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:03,797 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:56:03,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177414804] [2022-11-16 15:56:03,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177414804] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 15:56:03,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [480876369] [2022-11-16 15:56:03,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 15:56:03,798 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 15:56:03,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 15:56:03,801 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 15:56:03,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-16 15:56:05,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 15:56:05,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 15:56:05,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 15:56:05,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:56:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:05,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:56:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:05,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [480876369] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 15:56:05,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340368297] [2022-11-16 15:56:05,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 15:56:05,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 15:56:05,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 15:56:05,875 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 15:56:05,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-16 15:56:18,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 15:56:18,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 15:56:18,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 15:56:18,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:56:19,122 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 15:56:19,122 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-11-16 15:56:19,155 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-11-16 15:56:19,659 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 15:56:19,660 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-11-16 15:56:19,736 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-11-16 15:56:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 15:56:19,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:56:19,934 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-16 15:56:19,934 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-11-16 15:56:19,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_2339) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem39#1.base|)) is different from false [2022-11-16 15:56:19,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340368297] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 15:56:19,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-16 15:56:19,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-16 15:56:19,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414512656] [2022-11-16 15:56:19,953 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-16 15:56:19,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 15:56:19,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:56:19,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 15:56:19,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-11-16 15:56:19,954 INFO L87 Difference]: Start difference. First operand 5372 states and 7911 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-11-16 15:56:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:56:48,909 INFO L93 Difference]: Finished difference Result 14087 states and 21644 transitions. [2022-11-16 15:56:48,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 15:56:48,909 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-11-16 15:56:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:56:48,959 INFO L225 Difference]: With dead ends: 14087 [2022-11-16 15:56:48,959 INFO L226 Difference]: Without dead ends: 14087 [2022-11-16 15:56:48,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 368 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=318, Invalid=1916, Unknown=26, NotChecked=92, Total=2352 [2022-11-16 15:56:48,960 INFO L413 NwaCegarLoop]: 2179 mSDtfsCounter, 4075 mSDsluCounter, 23323 mSDsCounter, 0 mSdLazyCounter, 16092 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 25502 SdHoareTripleChecker+Invalid, 18078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 16092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1917 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2022-11-16 15:56:48,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4089 Valid, 25502 Invalid, 18078 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [69 Valid, 16092 Invalid, 0 Unknown, 1917 Unchecked, 27.5s Time] [2022-11-16 15:56:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14087 states. [2022-11-16 15:56:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14087 to 5378. [2022-11-16 15:56:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5378 states, 4489 states have (on average 1.7422588549788371) internal successors, (7821), 5331 states have internal predecessors, (7821), 46 states have call successors, (46), 4 states have call predecessors, (46), 6 states have return successors, (56), 43 states have call predecessors, (56), 46 states have call successors, (56) [2022-11-16 15:56:49,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5378 states to 5378 states and 7923 transitions. [2022-11-16 15:56:49,067 INFO L78 Accepts]: Start accepts. Automaton has 5378 states and 7923 transitions. Word has length 79 [2022-11-16 15:56:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:56:49,068 INFO L495 AbstractCegarLoop]: Abstraction has 5378 states and 7923 transitions. [2022-11-16 15:56:49,068 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-11-16 15:56:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 5378 states and 7923 transitions. [2022-11-16 15:56:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-16 15:56:49,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:56:49,069 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-11-16 15:56:49,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-11-16 15:56:49,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-16 15:56:49,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-11-16 15:56:49,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:56:49,678 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:56:49,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:56:49,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1075162869, now seen corresponding path program 1 times [2022-11-16 15:56:49,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:56:49,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837284303] [2022-11-16 15:56:49,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:56:49,679 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-11-16 15:56:49,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:56:49,680 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:56:49,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:56:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:56:50,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 15:56:50,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:56:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:50,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:56:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:50,405 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:56:50,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837284303] [2022-11-16 15:56:50,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837284303] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 15:56:50,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1722544432] [2022-11-16 15:56:50,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:56:50,406 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 15:56:50,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 15:56:50,411 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 15:56:50,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-16 15:56:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:56:51,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 15:56:51,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:56:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:51,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:56:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:51,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1722544432] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 15:56:51,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107427507] [2022-11-16 15:56:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:56:51,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 15:56:51,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 15:56:51,303 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 15:56:51,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-16 15:56:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:56:51,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 15:56:51,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:56:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:51,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:56:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:52,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107427507] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 15:56:52,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-16 15:56:52,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 20 [2022-11-16 15:56:52,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034793733] [2022-11-16 15:56:52,202 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-16 15:56:52,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 15:56:52,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:56:52,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 15:56:52,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2022-11-16 15:56:52,204 INFO L87 Difference]: Start difference. First operand 5378 states and 7923 transitions. Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 15:56:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:56:53,326 INFO L93 Difference]: Finished difference Result 5394 states and 7951 transitions. [2022-11-16 15:56:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 15:56:53,327 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 79 [2022-11-16 15:56:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:56:53,337 INFO L225 Difference]: With dead ends: 5394 [2022-11-16 15:56:53,338 INFO L226 Difference]: Without dead ends: 5386 [2022-11-16 15:56:53,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=416, Invalid=774, Unknown=0, NotChecked=0, Total=1190 [2022-11-16 15:56:53,339 INFO L413 NwaCegarLoop]: 2105 mSDtfsCounter, 84 mSDsluCounter, 14698 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 16803 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 15:56:53,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 16803 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 15:56:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5386 states. [2022-11-16 15:56:53,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5386 to 5380. [2022-11-16 15:56:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5380 states, 4492 states have (on average 1.7410952804986644) internal successors, (7821), 5333 states have internal predecessors, (7821), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-16 15:56:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5380 states to 5380 states and 7919 transitions. [2022-11-16 15:56:53,448 INFO L78 Accepts]: Start accepts. Automaton has 5380 states and 7919 transitions. Word has length 79 [2022-11-16 15:56:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:56:53,448 INFO L495 AbstractCegarLoop]: Abstraction has 5380 states and 7919 transitions. [2022-11-16 15:56:53,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 15:56:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 5380 states and 7919 transitions. [2022-11-16 15:56:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-16 15:56:53,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:56:53,450 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-11-16 15:56:53,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-16 15:56:53,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-11-16 15:56:53,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 15:56:54,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:56:54,057 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:56:54,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:56:54,058 INFO L85 PathProgramCache]: Analyzing trace with hash 71270384, now seen corresponding path program 1 times [2022-11-16 15:56:54,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:56:54,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960285341] [2022-11-16 15:56:54,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:56:54,059 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-11-16 15:56:54,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:56:54,060 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:56:54,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:56:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:56:54,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 15:56:54,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:56:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:54,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:56:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:55,323 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:56:55,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960285341] [2022-11-16 15:56:55,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960285341] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 15:56:55,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1306711133] [2022-11-16 15:56:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:56:55,323 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 15:56:55,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 15:56:55,324 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 15:56:55,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-16 15:56:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:56:56,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 15:56:56,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:56:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:56,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:56:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:56,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1306711133] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 15:56:56,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583497262] [2022-11-16 15:56:56,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:56:56,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 15:56:56,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 15:56:56,439 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 15:56:56,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-16 15:56:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:56:56,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 15:56:56,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:56:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:57,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:56:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:56:58,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583497262] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 15:56:58,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-16 15:56:58,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-11-16 15:56:58,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779625901] [2022-11-16 15:56:58,081 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-16 15:56:58,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 15:56:58,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:56:58,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 15:56:58,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-11-16 15:56:58,083 INFO L87 Difference]: Start difference. First operand 5380 states and 7919 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-11-16 15:57:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:57:02,105 INFO L93 Difference]: Finished difference Result 5420 states and 8014 transitions. [2022-11-16 15:57:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-16 15:57:02,106 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-11-16 15:57:02,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:57:02,116 INFO L225 Difference]: With dead ends: 5420 [2022-11-16 15:57:02,116 INFO L226 Difference]: Without dead ends: 5414 [2022-11-16 15:57:02,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1590, Invalid=3240, Unknown=0, NotChecked=0, Total=4830 [2022-11-16 15:57:02,118 INFO L413 NwaCegarLoop]: 2110 mSDtfsCounter, 172 mSDsluCounter, 31536 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 33646 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 15:57:02,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 33646 Invalid, 1088 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [172 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-16 15:57:02,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2022-11-16 15:57:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 5398. [2022-11-16 15:57:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5398 states, 4510 states have (on average 1.7392461197339246) internal successors, (7844), 5351 states have internal predecessors, (7844), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-16 15:57:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 7942 transitions. [2022-11-16 15:57:02,185 INFO L78 Accepts]: Start accepts. Automaton has 5398 states and 7942 transitions. Word has length 85 [2022-11-16 15:57:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:57:02,185 INFO L495 AbstractCegarLoop]: Abstraction has 5398 states and 7942 transitions. [2022-11-16 15:57:02,186 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-11-16 15:57:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5398 states and 7942 transitions. [2022-11-16 15:57:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-16 15:57:02,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:57:02,187 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-11-16 15:57:02,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 15:57:02,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-16 15:57:02,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-16 15:57:02,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 15:57:02,802 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:57:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:57:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2019676848, now seen corresponding path program 2 times [2022-11-16 15:57:02,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:57:02,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094401848] [2022-11-16 15:57:02,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 15:57:02,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-11-16 15:57:02,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:57:02,804 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:57:02,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:57:03,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 15:57:03,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 15:57:03,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 15:57:03,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:57:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:57:03,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:57:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:57:06,204 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:57:06,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094401848] [2022-11-16 15:57:06,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094401848] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 15:57:06,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [8607286] [2022-11-16 15:57:06,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 15:57:06,204 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 15:57:06,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 15:57:06,205 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 15:57:06,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-11-16 15:57:08,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 15:57:08,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 15:57:08,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 15:57:08,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:57:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:57:08,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:57:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:57:08,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [8607286] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 15:57:08,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211477336] [2022-11-16 15:57:08,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 15:57:08,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 15:57:08,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 15:57:08,815 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 15:57:08,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-16 15:57:30,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 15:57:30,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 15:57:30,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 15:57:30,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:57:31,058 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-11-16 15:57:31,072 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 15:57:31,073 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-11-16 15:57:31,183 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-11-16 15:57:31,193 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-11-16 15:57:31,551 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-11-16 15:57:31,557 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-11-16 15:57:31,725 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3939) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3938)))) is different from true [2022-11-16 15:57:31,739 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3941))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3940) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 15:57:32,163 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3949 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3949) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3948) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 15:57:32,178 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3950)))) is different from true [2022-11-16 15:57:32,325 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3954) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3955) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 15:57:32,339 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3957) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3956)))) is different from true [2022-11-16 15:57:32,478 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3960))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3961)))) is different from true [2022-11-16 15:57:32,620 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3964))) (exists ((v_ArrVal_3965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3965)))) is different from true [2022-11-16 15:57:32,631 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3966))) (exists ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3967) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32)))) is different from true [2022-11-16 15:57:32,644 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3969))) (exists ((v_ArrVal_3968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3968)))) is different from true [2022-11-16 15:57:32,657 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3970))) (exists ((v_ArrVal_3971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3971) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 15:57:32,668 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3973))) (exists ((v_ArrVal_3972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3972)))) is different from true [2022-11-16 15:57:32,682 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3974) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3975) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 15:57:32,695 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3977))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3976)))) is different from true [2022-11-16 15:57:32,708 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3978) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3979) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32)))) is different from true [2022-11-16 15:57:32,721 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3981))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3980) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 15:57:32,793 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 15:57:32,793 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-11-16 15:57:32,800 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-11-16 15:57:33,014 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-11-16 15:57:33,026 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-11-16 15:57:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 232 not checked. [2022-11-16 15:57:33,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:57:35,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211477336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 15:57:35,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-16 15:57:35,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 25] total 74 [2022-11-16 15:57:35,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013063980] [2022-11-16 15:57:35,117 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-16 15:57:35,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-16 15:57:35,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:57:35,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-16 15:57:35,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=2903, Unknown=90, NotChecked=2128, Total=5852 [2022-11-16 15:57:35,120 INFO L87 Difference]: Start difference. First operand 5398 states and 7942 transitions. Second operand has 74 states, 73 states have (on average 2.6986301369863015) internal successors, (197), 74 states have internal predecessors, (197), 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-11-16 15:58:14,255 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3949 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3949) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3943))) (exists ((v_ArrVal_3966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3966))) (exists ((v_ArrVal_3957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3957) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3967) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3977))) (exists ((v_ArrVal_3981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3981))) (exists ((v_ArrVal_3978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3978) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3979) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3974) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3960))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3954) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3970))) (exists ((v_ArrVal_3964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3964))) (exists ((v_ArrVal_3965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3965))) (exists ((v_ArrVal_3942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3948) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3961))) (exists ((v_ArrVal_3955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3955) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3950))) (exists ((v_ArrVal_3969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3969))) (exists ((v_ArrVal_3956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3956))) (exists ((v_ArrVal_3973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3973))) (exists ((v_ArrVal_3971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3971) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3975) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3976))) (exists ((v_ArrVal_3972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3972))) (exists ((v_ArrVal_3968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3968))) (exists ((v_ArrVal_3980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3980) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 15:59:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:59:34,699 INFO L93 Difference]: Finished difference Result 14204 states and 21785 transitions. [2022-11-16 15:59:34,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-11-16 15:59:34,700 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 2.6986301369863015) internal successors, (197), 74 states have internal predecessors, (197), 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-11-16 15:59:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:59:34,729 INFO L225 Difference]: With dead ends: 14204 [2022-11-16 15:59:34,730 INFO L226 Difference]: Without dead ends: 14196 [2022-11-16 15:59:34,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 406 SyntacticMatches, 6 SemanticMatches, 149 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 3715 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=4137, Invalid=13429, Unknown=324, NotChecked=4760, Total=22650 [2022-11-16 15:59:34,735 INFO L413 NwaCegarLoop]: 2202 mSDtfsCounter, 4034 mSDsluCounter, 61517 mSDsCounter, 0 mSdLazyCounter, 45372 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4051 SdHoareTripleChecker+Valid, 63719 SdHoareTripleChecker+Invalid, 133938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.5s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 45372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88462 IncrementalHoareTripleChecker+Unchecked, 81.4s IncrementalHoareTripleChecker+Time [2022-11-16 15:59:34,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4051 Valid, 63719 Invalid, 133938 Unknown, 0 Unchecked, 0.5s Time], IncrementalHoareTripleChecker [104 Valid, 45372 Invalid, 0 Unknown, 88462 Unchecked, 81.4s Time] [2022-11-16 15:59:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14196 states. [2022-11-16 15:59:34,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14196 to 5480. [2022-11-16 15:59:34,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5480 states, 4592 states have (on average 1.7290940766550522) internal successors, (7940), 5432 states have internal predecessors, (7940), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-16 15:59:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 8038 transitions. [2022-11-16 15:59:34,841 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 8038 transitions. Word has length 97 [2022-11-16 15:59:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:59:34,841 INFO L495 AbstractCegarLoop]: Abstraction has 5480 states and 8038 transitions. [2022-11-16 15:59:34,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 2.6986301369863015) internal successors, (197), 74 states have internal predecessors, (197), 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-11-16 15:59:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 8038 transitions. [2022-11-16 15:59:34,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-16 15:59:34,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:59:34,843 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-11-16 15:59:34,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2022-11-16 15:59:35,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:59:35,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-11-16 15:59:35,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 15:59:35,462 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:59:35,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:59:35,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1446350987, now seen corresponding path program 2 times [2022-11-16 15:59:35,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:59:35,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325438272] [2022-11-16 15:59:35,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 15:59:35,464 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-11-16 15:59:35,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:59:35,465 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:59:35,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-11-16 15:59:36,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 15:59:36,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 15:59:36,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 15:59:36,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:59:36,084 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-11-16 15:59:36,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 15:59:36,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 15:59:36,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 15:59:36,100 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-11-16 15:59:36,190 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 15:59:36,191 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-11-16 15:59:36,288 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-11-16 15:59:36,386 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-11-16 15:59:36,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 15:59:36,489 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-11-16 15:59:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-11-16 15:59:36,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 15:59:36,510 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:59:36,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325438272] [2022-11-16 15:59:36,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325438272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:59:36,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:59:36,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 15:59:36,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553062742] [2022-11-16 15:59:36,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:59:36,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 15:59:36,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 15:59:36,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 15:59:36,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 15:59:36,511 INFO L87 Difference]: Start difference. First operand 5480 states and 8038 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-11-16 15:59:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:59:49,642 INFO L93 Difference]: Finished difference Result 5661 states and 7969 transitions. [2022-11-16 15:59:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 15:59:49,643 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-11-16 15:59:49,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:59:49,652 INFO L225 Difference]: With dead ends: 5661 [2022-11-16 15:59:49,652 INFO L226 Difference]: Without dead ends: 5661 [2022-11-16 15:59:49,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 15:59:49,653 INFO L413 NwaCegarLoop]: 1411 mSDtfsCounter, 2055 mSDsluCounter, 5580 mSDsCounter, 0 mSdLazyCounter, 5045 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 6991 SdHoareTripleChecker+Invalid, 5076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-11-16 15:59:49,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2065 Valid, 6991 Invalid, 5076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5045 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2022-11-16 15:59:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5661 states. [2022-11-16 15:59:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5661 to 5080. [2022-11-16 15:59:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 4193 states have (on average 1.7529215358931554) internal successors, (7350), 5035 states have internal predecessors, (7350), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-16 15:59:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 7441 transitions. [2022-11-16 15:59:49,732 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 7441 transitions. Word has length 119 [2022-11-16 15:59:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:59:49,732 INFO L495 AbstractCegarLoop]: Abstraction has 5080 states and 7441 transitions. [2022-11-16 15:59:49,732 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-11-16 15:59:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 7441 transitions. [2022-11-16 15:59:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-16 15:59:49,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:59:49,734 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-11-16 15:59:49,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-11-16 15:59:49,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:59:49,949 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 15:59:49,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:59:49,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1028969817, now seen corresponding path program 1 times [2022-11-16 15:59:49,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 15:59:49,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611110037] [2022-11-16 15:59:49,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:59:49,951 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-11-16 15:59:49,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 15:59:49,951 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:59:49,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 15:59:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:59:51,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 15:59:51,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:59:51,025 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-11-16 15:59:51,184 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 15:59:51,185 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-11-16 15:59:51,214 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-11-16 15:59:51,319 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-11-16 15:59:51,453 WARN L855 $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_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786)))) is different from true [2022-11-16 15:59:51,734 WARN L855 $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_4794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4794) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 15:59:51,820 WARN L855 $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_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797)))) is different from true [2022-11-16 15:59:51,910 WARN L855 $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_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800)))) is different from true [2022-11-16 15:59:52,059 WARN L855 $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_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805)))) is different from true [2022-11-16 15:59:52,660 WARN L855 $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_4822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4822) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 15:59:52,983 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 15:59:52,983 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-11-16 15:59:53,114 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 15:59:53,115 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-11-16 15:59:53,140 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-11-16 15:59:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-11-16 15:59:53,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 15:59:55,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4830 (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_4830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-16 15:59:55,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4830 (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_4876))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4830)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-16 15:59:55,653 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 15:59:55,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611110037] [2022-11-16 15:59:55,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611110037] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 15:59:55,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [708726136] [2022-11-16 15:59:55,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:59:55,654 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 15:59:55,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 15:59:55,655 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 15:59:55,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-16 15:59:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:59:59,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-16 15:59:59,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 15:59:59,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-11-16 15:59:59,793 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 15:59:59,793 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-11-16 15:59:59,816 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-11-16 15:59:59,877 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-11-16 15:59:59,987 WARN L855 $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_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:00:00,070 WARN L855 $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_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259)))) is different from true [2022-11-16 16:00:00,521 WARN L855 $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_5272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5272)))) is different from true [2022-11-16 16:00:00,646 WARN L855 $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_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276)))) is different from true [2022-11-16 16:00:00,898 WARN L855 $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_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283)))) is different from true [2022-11-16 16:00:01,191 WARN L855 $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_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291)))) is different from true [2022-11-16 16:00:01,541 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:00:01,541 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-11-16 16:00:01,623 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:00:01,623 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-11-16 16:00:01,650 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-11-16 16:00:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-11-16 16:00:01,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:00:01,679 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5300 (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_5300) |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-11-16 16:00:01,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-11-16 16:00:01,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5346 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5346))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5300)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-16 16:00:01,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [708726136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:00:01,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726812552] [2022-11-16 16:00:01,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:00:01,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:00:01,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:00:01,996 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:00:02,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-16 16:00:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:00:02,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 16:00:02,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:00:02,945 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 16:00:02,945 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-11-16 16:00:02,983 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-11-16 16:00:05,162 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:00:05,162 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-11-16 16:00:05,326 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:00:05,327 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-11-16 16:00:05,345 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-11-16 16:00:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-16 16:00:05,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:00:07,743 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-16 16:00:07,744 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-11-16 16:00:07,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4830 (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_5814))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4830)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem39#1.base|)) is different from false [2022-11-16 16:00:07,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726812552] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:00:07,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:00:07,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 12] total 31 [2022-11-16 16:00:07,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535055294] [2022-11-16 16:00:07,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:00:07,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 16:00:07,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 16:00:07,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 16:00:07,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=387, Unknown=41, NotChecked=1026, Total=1560 [2022-11-16 16:00:07,765 INFO L87 Difference]: Start difference. First operand 5080 states and 7441 transitions. Second operand has 32 states, 29 states have (on average 5.241379310344827) internal successors, (152), 31 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 16:00:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:00:29,740 INFO L93 Difference]: Finished difference Result 13700 states and 20996 transitions. [2022-11-16 16:00:29,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 16:00:29,741 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.241379310344827) internal successors, (152), 31 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2022-11-16 16:00:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:00:29,757 INFO L225 Difference]: With dead ends: 13700 [2022-11-16 16:00:29,758 INFO L226 Difference]: Without dead ends: 13697 [2022-11-16 16:00:29,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 226 SyntacticMatches, 124 SemanticMatches, 47 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=175, Invalid=776, Unknown=51, NotChecked=1350, Total=2352 [2022-11-16 16:00:29,759 INFO L413 NwaCegarLoop]: 2096 mSDtfsCounter, 4231 mSDsluCounter, 17684 mSDsCounter, 0 mSdLazyCounter, 9731 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4245 SdHoareTripleChecker+Valid, 19780 SdHoareTripleChecker+Invalid, 56462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 9731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46684 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2022-11-16 16:00:29,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4245 Valid, 19780 Invalid, 56462 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 9731 Invalid, 0 Unknown, 46684 Unchecked, 21.0s Time] [2022-11-16 16:00:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13697 states. [2022-11-16 16:00:29,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13697 to 5079. [2022-11-16 16:00:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5079 states, 4193 states have (on average 1.7512520868113524) internal successors, (7343), 5034 states have internal predecessors, (7343), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-16 16:00:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 7434 transitions. [2022-11-16 16:00:29,864 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 7434 transitions. Word has length 122 [2022-11-16 16:00:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:00:29,864 INFO L495 AbstractCegarLoop]: Abstraction has 5079 states and 7434 transitions. [2022-11-16 16:00:29,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.241379310344827) internal successors, (152), 31 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 16:00:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 7434 transitions. [2022-11-16 16:00:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-16 16:00:29,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:00:29,866 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-11-16 16:00:29,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-16 16:00:30,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2022-11-16 16:00:30,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 16:00:30,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 16:00:30,493 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-16 16:00:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:00:30,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1028969818, now seen corresponding path program 1 times [2022-11-16 16:00:30,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 16:00:30,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533627928] [2022-11-16 16:00:30,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:00:30,494 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-11-16 16:00:30,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 16:00:30,495 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -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-11-16 16:00:30,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-11-16 16:00:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:00:31,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-16 16:00:31,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:00:31,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 7 [2022-11-16 16:00:31,800 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 16:00:31,800 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-11-16 16:00:31,811 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-11-16 16:00:31,840 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-11-16 16:00:31,852 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-11-16 16:00:31,969 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-11-16 16:00:31,974 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-11-16 16:00:32,041 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6196))) (exists ((v_ArrVal_6197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6197))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:00:32,096 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6201) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6200)))) is different from true [2022-11-16 16:00:32,113 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6203))) (exists ((v_ArrVal_6202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6202)))) is different from true [2022-11-16 16:00:32,129 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6205))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:00:32,144 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6207) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6206 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6206)))) is different from true [2022-11-16 16:00:32,160 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6208 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6208))) (exists ((v_ArrVal_6209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6209) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:00:32,176 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6210))) (exists ((v_ArrVal_6211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6211)))) is different from true [2022-11-16 16:00:32,191 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6212 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6212))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6213)))) is different from true [2022-11-16 16:00:32,206 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6215 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6215) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6214)))) is different from true [2022-11-16 16:00:32,221 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6217) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6216))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:00:32,236 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6219) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6218)))) is different from true [2022-11-16 16:00:32,251 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6221) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6220 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6220)))) is different from true [2022-11-16 16:00:32,266 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6222))) (exists ((v_ArrVal_6223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6223)))) is different from true [2022-11-16 16:00:32,281 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6225))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6224 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6224) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:00:32,296 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6227) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6226)))) is different from true [2022-11-16 16:00:32,311 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6228))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6229)))) is different from true [2022-11-16 16:00:32,325 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6230 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6230))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6231) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:00:32,338 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6233))) (exists ((v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6232) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:00:32,351 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6235))) (exists ((v_ArrVal_6234 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6234) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:00:32,364 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6236) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6237)))) is different from true [2022-11-16 16:00:32,377 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6239))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6238) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:00:32,390 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6240) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6241 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6241)))) is different from true [2022-11-16 16:00:32,433 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6243))) (exists ((v_ArrVal_6242 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6242)))) is different from true [2022-11-16 16:00:32,446 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6245) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6244)))) is different from true [2022-11-16 16:00:32,460 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6246))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6247) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:00:32,477 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6249 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6249) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6248)))) is different from true [2022-11-16 16:00:32,493 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6250))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6251)))) is different from true [2022-11-16 16:00:32,508 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6253))) (exists ((v_ArrVal_6252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6252))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:00:32,523 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6254))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6255) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:00:32,538 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6257))) (exists ((v_ArrVal_6256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6256)))) is different from true [2022-11-16 16:00:32,553 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6258))) (exists ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6259)))) is different from true [2022-11-16 16:00:32,567 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6261) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:00:32,582 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6262) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6263)))) is different from true [2022-11-16 16:00:32,597 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6264 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6264) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6265) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:00:32,616 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6267 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6267))) (exists ((v_ArrVal_6266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6266)))) is different from true [2022-11-16 16:00:32,631 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6269) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6268)))) is different from true [2022-11-16 16:00:32,647 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6270))) (exists ((v_ArrVal_6271 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6271) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:00:32,662 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6272))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6273) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:00:32,678 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6275))) (exists ((v_ArrVal_6274 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6274))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:00:32,691 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6277))) (exists ((v_ArrVal_6276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6276)))) is different from true [2022-11-16 16:00:32,704 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6278))) (exists ((v_ArrVal_6279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6279))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:00:32,725 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6281 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6281))) (exists ((v_ArrVal_6280 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6280) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:00:32,749 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6283) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6282))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:00:32,799 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:00:32,799 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-11-16 16:00:32,814 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-11-16 16:00:32,945 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:00:32,946 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-11-16 16:00:32,952 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-11-16 16:00:32,984 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-11-16 16:00:32,991 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-11-16 16:00:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-11-16 16:00:33,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:00:33,228 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-16 16:00:33,269 WARN L833 $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_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-16 16:00:34,270 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6377 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6377))) (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_6376) .cse0 v_ArrVal_6285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6377 (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_6376) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6377) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-16 16:00:34,279 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 16:00:34,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533627928] [2022-11-16 16:00:34,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533627928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:00:34,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [759586408] [2022-11-16 16:00:34,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:00:34,280 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 16:00:34,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 16:00:34,281 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 16:00:34,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2022-11-16 16:02:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:02:29,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-16 16:02:29,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:02:29,734 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-11-16 16:02:29,909 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 16:02:29,909 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-11-16 16:02:29,920 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-11-16 16:02:29,932 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-11-16 16:02:29,947 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-11-16 16:02:30,020 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-11-16 16:02:30,026 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-11-16 16:02:30,095 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6760) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6759) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:30,110 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6762))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6761)))) is different from true [2022-11-16 16:02:30,126 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6764))) (exists ((v_ArrVal_6763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6763) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:02:30,141 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6765) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6766)))) is different from true [2022-11-16 16:02:30,156 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6767) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:02:30,171 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6770) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6769)))) is different from true [2022-11-16 16:02:30,186 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6771) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6772)))) is different from true [2022-11-16 16:02:30,202 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6773))) (exists ((v_ArrVal_6774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6774) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:30,222 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6776) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6775 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6775))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:02:30,238 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6777))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6778)))) is different from true [2022-11-16 16:02:30,254 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6780 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6780) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6779)))) is different from true [2022-11-16 16:02:30,269 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6781))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6782)))) is different from true [2022-11-16 16:02:30,284 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6784))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6783)))) is different from true [2022-11-16 16:02:30,299 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6785) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786)))) is different from true [2022-11-16 16:02:30,315 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6788) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:30,328 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6789))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790)))) is different from true [2022-11-16 16:02:30,341 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:02:30,356 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:30,371 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6796) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795)))) is different from true [2022-11-16 16:02:30,386 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6797))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6798) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:02:30,401 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6800 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6800) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6799)))) is different from true [2022-11-16 16:02:30,417 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6801) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6802)))) is different from true [2022-11-16 16:02:30,432 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6803))) (exists ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6804)))) is different from true [2022-11-16 16:02:30,447 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6805) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6806)))) is different from true [2022-11-16 16:02:30,462 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6807))) (exists ((v_ArrVal_6808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6808)))) is different from true [2022-11-16 16:02:30,477 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6809))) (exists ((v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6810) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:02:30,493 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6812))) (exists ((v_ArrVal_6811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6811)))) is different from true [2022-11-16 16:02:30,508 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6813))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6814) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:30,523 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6816))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6815) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:30,538 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6817) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6818) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:30,553 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6819))) (exists ((v_ArrVal_6820 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6820)))) is different from true [2022-11-16 16:02:30,582 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6822))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6821)))) is different from true [2022-11-16 16:02:30,595 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6823))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6824) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:02:30,607 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6826) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6825) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:30,620 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6828 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6828))) (exists ((v_ArrVal_6827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6827)))) is different from true [2022-11-16 16:02:30,632 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6829))) (exists ((v_ArrVal_6830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6830)))) is different from true [2022-11-16 16:02:30,645 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6832))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6831)))) is different from true [2022-11-16 16:02:30,658 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6834))) (exists ((v_ArrVal_6833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6833)))) is different from true [2022-11-16 16:02:30,670 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6836) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6835) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:30,683 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6838 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6838) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6837)))) is different from true [2022-11-16 16:02:30,696 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6839))) (exists ((v_ArrVal_6840 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6840) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:02:30,709 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6842 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6842))) (exists ((v_ArrVal_6841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6841)))) is different from true [2022-11-16 16:02:30,721 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6844))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6843 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6843)))) is different from true [2022-11-16 16:02:30,736 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6846 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6846))) (exists ((v_ArrVal_6845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6845)))) is different from true [2022-11-16 16:02:30,790 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:02:30,790 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-11-16 16:02:30,796 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-11-16 16:02:30,876 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:02:30,876 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-11-16 16:02:30,889 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-11-16 16:02:30,913 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-11-16 16:02:30,920 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-11-16 16:02:30,926 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-16 16:02:30,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:02:30,998 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6847 (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_6848) |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_6847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6848 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-16 16:02:31,038 WARN L833 $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_6848 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6847 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-16 16:02:32,017 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6940 (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_6939) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6940) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6940))) (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_6939) .cse2 v_ArrVal_6848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-16 16:02:32,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [759586408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:02:32,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097284483] [2022-11-16 16:02:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:02:32,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:02:32,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:02:32,029 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:02:32,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_537bf962-3c35-441b-951f-1c2138be6983/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-11-16 16:02:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:02:32,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-16 16:02:32,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:02:33,119 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-11-16 16:02:33,138 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 16:02:33,138 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-11-16 16:02:33,148 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-11-16 16:02:33,159 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-11-16 16:02:33,237 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-11-16 16:02:33,242 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-11-16 16:02:33,306 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7321 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7321))) (exists ((v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7322)))) is different from true [2022-11-16 16:02:33,358 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7325) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7326)))) is different from true [2022-11-16 16:02:33,371 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7328) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7327)))) is different from true [2022-11-16 16:02:33,451 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7334 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7334))) (exists ((v_ArrVal_7333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7333)))) is different from true [2022-11-16 16:02:33,472 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7336))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7335)))) is different from true [2022-11-16 16:02:33,525 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7339))) (exists ((v_ArrVal_7340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7340)))) is different from true [2022-11-16 16:02:33,541 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7341 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7341))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7342) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:33,556 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7344 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7344))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7343)))) is different from true [2022-11-16 16:02:33,571 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7345))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7346 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7346) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:33,587 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7347))) (exists ((v_ArrVal_7348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7348) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:02:33,602 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7350 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7350))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7349)))) is different from true [2022-11-16 16:02:33,618 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7352))) (exists ((v_ArrVal_7351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7351) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:02:33,637 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7353 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7353))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7354) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:33,653 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7355))) (exists ((v_ArrVal_7356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7356) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:02:33,668 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7358))) (exists ((v_ArrVal_7357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7357)))) is different from true [2022-11-16 16:02:33,684 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7360) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7359)))) is different from true [2022-11-16 16:02:33,699 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7362))) (exists ((v_ArrVal_7361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7361)))) is different from true [2022-11-16 16:02:33,714 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7363 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7363) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7364)))) is different from true [2022-11-16 16:02:33,730 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7365))) (exists ((v_ArrVal_7366 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7366) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:02:33,745 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7367))) (exists ((v_ArrVal_7368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7368)))) is different from true [2022-11-16 16:02:33,760 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7369) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7370 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7370)))) is different from true [2022-11-16 16:02:33,775 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7371) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7372) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:33,790 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7373) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:33,805 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7375))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7376)))) is different from true [2022-11-16 16:02:33,820 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7377))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7378)))) is different from true [2022-11-16 16:02:33,836 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7380 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7380) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7379)))) is different from true [2022-11-16 16:02:33,850 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7381))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7382)))) is different from true [2022-11-16 16:02:33,865 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7383))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7384) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:02:33,881 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7385 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7385))) (exists ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7386) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:33,897 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7388))) (exists ((v_ArrVal_7387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7387) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:33,910 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7390) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7389))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32)))) is different from true [2022-11-16 16:02:33,923 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7391))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7392) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:02:33,938 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7394 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7394) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7393 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7393) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 16:02:33,951 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7396))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7395) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 16:02:33,964 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7398))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7397)))) is different from true [2022-11-16 16:02:33,977 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7399) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7400 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7400)))) is different from true [2022-11-16 16:02:34,014 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7402 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7402) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7401)))) is different from true [2022-11-16 16:02:34,029 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7403) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7404)))) is different from true [2022-11-16 16:02:34,045 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7405) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7406)))) is different from true [2022-11-16 16:02:34,060 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_7407 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7407) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7408 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7408)))) is different from true [2022-11-16 16:02:34,112 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:02:34,113 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-11-16 16:02:34,126 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-11-16 16:02:34,202 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:02:34,202 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-11-16 16:02:34,216 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-11-16 16:02:34,240 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-11-16 16:02:34,247 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-11-16 16:02:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 980 not checked. [2022-11-16 16:02:34,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:02:34,323 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-16 16:02:34,367 WARN L833 $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_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-16 16:02:35,425 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7502))) (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_7501) .cse0 v_ArrVal_7409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7410) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7502 (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_7501) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7502) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-16 16:02:35,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097284483] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:02:35,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:02:35,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 50] total 137 [2022-11-16 16:02:35,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648605297] [2022-11-16 16:02:35,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:02:35,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 138 states [2022-11-16 16:02:35,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 16:02:35,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2022-11-16 16:02:35,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=257, Unknown=142, NotChecked=21352, Total=22052 [2022-11-16 16:02:35,444 INFO L87 Difference]: Start difference. First operand 5079 states and 7434 transitions. Second operand has 138 states, 136 states have (on average 1.7941176470588236) internal successors, (244), 138 states have internal predecessors, (244), 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-11-16 16:02:57,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:02:57,835 INFO L93 Difference]: Finished difference Result 13106 states and 20160 transitions. [2022-11-16 16:02:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 16:02:57,836 INFO L78 Accepts]: Start accepts. Automaton has has 138 states, 136 states have (on average 1.7941176470588236) internal successors, (244), 138 states have internal predecessors, (244), 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-11-16 16:02:57,836 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-11-16 16:02:57,836 INFO L78 Accepts]: Start accepts. Automaton has has 138 states, 136 states have (on average 1.7941176470588236) internal successors, (244), 138 states have internal predecessors, (244), 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