./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS --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 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e --- 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-8393723 [2022-11-19 08:13:07,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:13:07,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:13:07,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:13:07,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:13:07,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:13:07,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:13:07,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:13:07,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:13:07,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:13:07,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:13:07,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:13:07,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:13:07,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:13:07,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:13:07,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:13:07,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:13:07,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:13:07,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:13:07,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:13:07,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:13:07,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:13:07,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:13:07,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:13:07,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:13:07,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:13:07,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:13:07,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:13:07,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:13:07,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:13:07,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:13:07,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:13:07,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:13:07,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:13:07,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:13:07,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:13:07,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:13:07,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:13:07,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:13:07,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:13:07,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:13:07,282 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 08:13:07,331 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:13:07,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:13:07,332 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:13:07,333 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:13:07,334 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:13:07,334 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:13:07,334 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:13:07,334 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:13:07,335 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:13:07,335 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:13:07,336 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:13:07,336 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:13:07,336 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:13:07,337 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:13:07,337 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:13:07,337 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:13:07,337 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:13:07,338 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:13:07,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:13:07,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:13:07,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:13:07,341 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:13:07,341 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:13:07,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:13:07,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:13:07,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:13:07,342 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:13:07,342 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:13:07,342 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:13:07,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:13:07,343 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:13:07,343 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:13:07,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:13:07,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:13:07,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:13:07,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:13:07,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:13:07,345 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:13:07,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:13:07,345 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:13:07,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:13:07,346 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:13:07,346 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_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/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_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS 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 -> 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e [2022-11-19 08:13:07,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:13:07,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:13:07,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:13:07,670 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:13:07,671 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:13:07,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2022-11-19 08:13:07,751 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/data/f40edd632/7ab0b10e881b4454b49d890104268e69/FLAG87659b81d [2022-11-19 08:13:08,300 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:13:08,308 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2022-11-19 08:13:08,332 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/data/f40edd632/7ab0b10e881b4454b49d890104268e69/FLAG87659b81d [2022-11-19 08:13:08,564 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/data/f40edd632/7ab0b10e881b4454b49d890104268e69 [2022-11-19 08:13:08,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:13:08,569 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:13:08,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:13:08,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:13:08,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:13:08,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:13:08" (1/1) ... [2022-11-19 08:13:08,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a69899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:08, skipping insertion in model container [2022-11-19 08:13:08,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:13:08" (1/1) ... [2022-11-19 08:13:08,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:13:08,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:13:09,063 WARN L234 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_06637e60-761a-4786-9342-0fc702c805f2/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i[33021,33034] [2022-11-19 08:13:09,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:13:09,187 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-19 08:13:09,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@734c761e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:09, skipping insertion in model container [2022-11-19 08:13:09,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:13:09,201 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-19 08:13:09,202 INFO L158 Benchmark]: Toolchain (without parser) took 632.45ms. Allocated memory is still 123.7MB. Free memory was 76.4MB in the beginning and 86.5MB in the end (delta: -10.1MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2022-11-19 08:13:09,203 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 123.7MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:13:09,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.89ms. Allocated memory is still 123.7MB. Free memory was 76.2MB in the beginning and 86.5MB in the end (delta: -10.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2022-11-19 08:13:09,205 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 123.7MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.89ms. Allocated memory is still 123.7MB. Free memory was 76.2MB in the beginning and 86.5MB in the end (delta: -10.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS --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 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e --- 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-8393723 [2022-11-19 08:13:11,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:13:11,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:13:11,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:13:11,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:13:11,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:13:11,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:13:11,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:13:11,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:13:11,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:13:11,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:13:11,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:13:11,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:13:11,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:13:11,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:13:11,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:13:11,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:13:11,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:13:11,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:13:11,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:13:11,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:13:11,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:13:11,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:13:11,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:13:11,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:13:11,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:13:11,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:13:11,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:13:11,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:13:11,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:13:11,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:13:11,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:13:11,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:13:11,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:13:11,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:13:11,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:13:11,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:13:11,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:13:11,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:13:11,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:13:11,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:13:11,344 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 08:13:11,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:13:11,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:13:11,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:13:11,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:13:11,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:13:11,374 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:13:11,374 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:13:11,374 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:13:11,374 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:13:11,374 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:13:11,374 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:13:11,375 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:13:11,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:13:11,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:13:11,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:13:11,376 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:13:11,376 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:13:11,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:13:11,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:13:11,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:13:11,377 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:13:11,377 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:13:11,377 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:13:11,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:13:11,378 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:13:11,378 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 08:13:11,378 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 08:13:11,378 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:13:11,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:13:11,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:13:11,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 08:13:11,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:13:11,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:13:11,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:13:11,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:13:11,380 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 08:13:11,380 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 08:13:11,380 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:13:11,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 08:13:11,380 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_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/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_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS 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 -> 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e [2022-11-19 08:13:11,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:13:11,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:13:11,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:13:11,807 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:13:11,808 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:13:11,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2022-11-19 08:13:11,894 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/data/0949f775a/8ba2f8be71fc48f4ae9823018314a26b/FLAGa66057ea6 [2022-11-19 08:13:12,518 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:13:12,519 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2022-11-19 08:13:12,552 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/data/0949f775a/8ba2f8be71fc48f4ae9823018314a26b/FLAGa66057ea6 [2022-11-19 08:13:12,762 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/data/0949f775a/8ba2f8be71fc48f4ae9823018314a26b [2022-11-19 08:13:12,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:13:12,766 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:13:12,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:13:12,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:13:12,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:13:12,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:13:12" (1/1) ... [2022-11-19 08:13:12,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a3e2ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:12, skipping insertion in model container [2022-11-19 08:13:12,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:13:12" (1/1) ... [2022-11-19 08:13:12,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:13:12,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:13:13,311 WARN L234 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_06637e60-761a-4786-9342-0fc702c805f2/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i[33021,33034] [2022-11-19 08:13:13,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:13:13,477 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-19 08:13:13,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:13:13,504 WARN L234 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_06637e60-761a-4786-9342-0fc702c805f2/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i[33021,33034] [2022-11-19 08:13:13,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:13:13,600 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:13:13,627 WARN L234 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_06637e60-761a-4786-9342-0fc702c805f2/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i[33021,33034] [2022-11-19 08:13:13,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:13:13,724 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:13:13,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:13 WrapperNode [2022-11-19 08:13:13,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:13:13,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:13:13,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:13:13,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:13:13,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:13" (1/1) ... [2022-11-19 08:13:13,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:13" (1/1) ... [2022-11-19 08:13:13,851 INFO L138 Inliner]: procedures = 180, calls = 349, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1158 [2022-11-19 08:13:13,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:13:13,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:13:13,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:13:13,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:13:13,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:13" (1/1) ... [2022-11-19 08:13:13,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:13" (1/1) ... [2022-11-19 08:13:13,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:13" (1/1) ... [2022-11-19 08:13:13,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:13" (1/1) ... [2022-11-19 08:13:13,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:13" (1/1) ... [2022-11-19 08:13:13,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:13" (1/1) ... [2022-11-19 08:13:13,993 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:13" (1/1) ... [2022-11-19 08:13:13,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:13" (1/1) ... [2022-11-19 08:13:14,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:13:14,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:13:14,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:13:14,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:13:14,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:13" (1/1) ... [2022-11-19 08:13:14,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:13:14,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:13:14,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:13:14,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:13:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-19 08:13:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-19 08:13:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-19 08:13:14,101 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-19 08:13:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-19 08:13:14,102 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-19 08:13:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 08:13:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:13:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:13:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 08:13:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 08:13:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:13:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 08:13:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 08:13:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:13:14,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:13:14,401 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:13:14,403 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:13:14,408 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-19 08:13:20,475 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:13:20,489 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:13:20,489 INFO L300 CfgBuilder]: Removed 60 assume(true) statements. [2022-11-19 08:13:20,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:13:20 BoogieIcfgContainer [2022-11-19 08:13:20,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:13:20,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:13:20,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:13:20,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:13:20,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:13:12" (1/3) ... [2022-11-19 08:13:20,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2228bbc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:13:20, skipping insertion in model container [2022-11-19 08:13:20,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:13" (2/3) ... [2022-11-19 08:13:20,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2228bbc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:13:20, skipping insertion in model container [2022-11-19 08:13:20,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:13:20" (3/3) ... [2022-11-19 08:13:20,502 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test4-1.i [2022-11-19 08:13:20,520 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:13:20,521 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 648 error locations. [2022-11-19 08:13:20,582 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:13:20,589 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;@712d7e03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:13:20,589 INFO L358 AbstractCegarLoop]: Starting to check reachability of 648 error locations. [2022-11-19 08:13:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 1272 states, 611 states have (on average 2.258592471358429) internal successors, (1380), 1263 states have internal predecessors, (1380), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:13:20,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:20,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:13:20,604 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:20,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:20,609 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-19 08:13:20,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:20,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762020126] [2022-11-19 08:13:20,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:20,623 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-19 08:13:20,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:20,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:20,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:20,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 08:13:20,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:20,868 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-19 08:13:20,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:20,869 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:20,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762020126] [2022-11-19 08:13:20,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762020126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:20,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:20,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:13:20,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562604390] [2022-11-19 08:13:20,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:20,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 08:13:20,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:20,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 08:13:20,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:13:20,922 INFO L87 Difference]: Start difference. First operand has 1272 states, 611 states have (on average 2.258592471358429) internal successors, (1380), 1263 states have internal predecessors, (1380), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:21,016 INFO L93 Difference]: Finished difference Result 1254 states and 1326 transitions. [2022-11-19 08:13:21,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 08:13:21,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-19 08:13:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:21,069 INFO L225 Difference]: With dead ends: 1254 [2022-11-19 08:13:21,069 INFO L226 Difference]: Without dead ends: 1252 [2022-11-19 08:13:21,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:13:21,083 INFO L413 NwaCegarLoop]: 1326 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:21,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:13:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-11-19 08:13:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2022-11-19 08:13:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 602 states have (on average 2.1461794019933556) internal successors, (1292), 1243 states have internal predecessors, (1292), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1324 transitions. [2022-11-19 08:13:21,220 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1324 transitions. Word has length 5 [2022-11-19 08:13:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:21,220 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1324 transitions. [2022-11-19 08:13:21,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1324 transitions. [2022-11-19 08:13:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:13:21,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:21,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:13:21,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:21,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:21,433 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:21,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:21,434 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-19 08:13:21,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:21,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297545416] [2022-11-19 08:13:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:21,435 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-19 08:13:21,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:21,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:21,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:21,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:13:21,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:21,692 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-19 08:13:21,717 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-19 08:13:21,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:21,718 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:21,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297545416] [2022-11-19 08:13:21,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297545416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:21,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:21,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:13:21,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136052693] [2022-11-19 08:13:21,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:21,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:13:21,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:21,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:13:21,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:13:21,721 INFO L87 Difference]: Start difference. First operand 1252 states and 1324 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:24,752 INFO L93 Difference]: Finished difference Result 1289 states and 1374 transitions. [2022-11-19 08:13:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:13:24,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-19 08:13:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:24,758 INFO L225 Difference]: With dead ends: 1289 [2022-11-19 08:13:24,758 INFO L226 Difference]: Without dead ends: 1289 [2022-11-19 08:13:24,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:13:24,760 INFO L413 NwaCegarLoop]: 596 mSDtfsCounter, 1155 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:24,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 700 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-19 08:13:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-11-19 08:13:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1235. [2022-11-19 08:13:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 678 states have (on average 1.9675516224188792) internal successors, (1334), 1226 states have internal predecessors, (1334), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1366 transitions. [2022-11-19 08:13:24,804 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1366 transitions. Word has length 5 [2022-11-19 08:13:24,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:24,805 INFO L495 AbstractCegarLoop]: Abstraction has 1235 states and 1366 transitions. [2022-11-19 08:13:24,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1366 transitions. [2022-11-19 08:13:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:13:24,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:24,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:13:24,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:25,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:25,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:25,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:25,019 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-19 08:13:25,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:25,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415741181] [2022-11-19 08:13:25,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:25,020 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-19 08:13:25,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:25,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:25,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:25,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:13:25,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:25,175 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-19 08:13:25,199 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-19 08:13:25,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:25,200 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:25,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415741181] [2022-11-19 08:13:25,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415741181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:25,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:25,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:13:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828813936] [2022-11-19 08:13:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:25,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:13:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:25,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:13:25,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:13:25,203 INFO L87 Difference]: Start difference. First operand 1235 states and 1366 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:29,366 INFO L93 Difference]: Finished difference Result 1538 states and 1689 transitions. [2022-11-19 08:13:29,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:13:29,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-19 08:13:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:29,372 INFO L225 Difference]: With dead ends: 1538 [2022-11-19 08:13:29,372 INFO L226 Difference]: Without dead ends: 1538 [2022-11-19 08:13:29,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:13:29,373 INFO L413 NwaCegarLoop]: 992 mSDtfsCounter, 504 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:29,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1475 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-19 08:13:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-11-19 08:13:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1391. [2022-11-19 08:13:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 844 states have (on average 1.9431279620853081) internal successors, (1640), 1382 states have internal predecessors, (1640), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1672 transitions. [2022-11-19 08:13:29,409 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1672 transitions. Word has length 5 [2022-11-19 08:13:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:29,410 INFO L495 AbstractCegarLoop]: Abstraction has 1391 states and 1672 transitions. [2022-11-19 08:13:29,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1672 transitions. [2022-11-19 08:13:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 08:13:29,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:29,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 08:13:29,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:29,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:29,622 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:29,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1157590079, now seen corresponding path program 1 times [2022-11-19 08:13:29,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:29,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956288029] [2022-11-19 08:13:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:29,623 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-19 08:13:29,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:29,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:29,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:29,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:13:29,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:29,769 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-19 08:13:29,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:29,769 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:29,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956288029] [2022-11-19 08:13:29,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956288029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:29,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:29,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:13:29,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262650590] [2022-11-19 08:13:29,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:29,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:13:29,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:29,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:13:29,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:13:29,777 INFO L87 Difference]: Start difference. First operand 1391 states and 1672 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:29,905 INFO L93 Difference]: Finished difference Result 2733 states and 3275 transitions. [2022-11-19 08:13:29,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:13:29,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-19 08:13:29,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:29,918 INFO L225 Difference]: With dead ends: 2733 [2022-11-19 08:13:29,919 INFO L226 Difference]: Without dead ends: 2733 [2022-11-19 08:13:29,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-19 08:13:29,922 INFO L413 NwaCegarLoop]: 1498 mSDtfsCounter, 1139 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:29,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 2714 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:13:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2022-11-19 08:13:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 1392. [2022-11-19 08:13:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 845 states have (on average 1.9420118343195267) internal successors, (1641), 1383 states have internal predecessors, (1641), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1673 transitions. [2022-11-19 08:13:29,973 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1673 transitions. Word has length 6 [2022-11-19 08:13:29,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:29,975 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 1673 transitions. [2022-11-19 08:13:29,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1673 transitions. [2022-11-19 08:13:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 08:13:29,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:29,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:13:29,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:30,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:30,192 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:30,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:30,193 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-19 08:13:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:30,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936211425] [2022-11-19 08:13:30,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:30,193 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-19 08:13:30,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:30,195 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:30,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:30,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:13:30,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:30,394 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-19 08:13:30,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:30,394 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:30,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936211425] [2022-11-19 08:13:30,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936211425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:30,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:30,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:13:30,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408942944] [2022-11-19 08:13:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:30,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:13:30,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:30,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:13:30,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:13:30,397 INFO L87 Difference]: Start difference. First operand 1392 states and 1673 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-19 08:13:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:30,439 INFO L93 Difference]: Finished difference Result 1356 states and 1636 transitions. [2022-11-19 08:13:30,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:13:30,439 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-19 08:13:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:30,444 INFO L225 Difference]: With dead ends: 1356 [2022-11-19 08:13:30,445 INFO L226 Difference]: Without dead ends: 1356 [2022-11-19 08:13:30,445 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-19 08:13:30,446 INFO L413 NwaCegarLoop]: 1173 mSDtfsCounter, 1133 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1206 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-19 08:13:30,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 1206 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:13:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-11-19 08:13:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1350. [2022-11-19 08:13:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 827 states have (on average 1.932285368802902) internal successors, (1598), 1341 states have internal predecessors, (1598), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1630 transitions. [2022-11-19 08:13:30,475 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1630 transitions. Word has length 11 [2022-11-19 08:13:30,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:30,476 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 1630 transitions. [2022-11-19 08:13:30,476 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-19 08:13:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1630 transitions. [2022-11-19 08:13:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:13:30,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:30,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:13:30,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:30,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:30,689 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:30,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-19 08:13:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:30,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428354310] [2022-11-19 08:13:30,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:30,690 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-19 08:13:30,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:30,691 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:30,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:30,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:13:30,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:30,916 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-19 08:13:30,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:30,918 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:30,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428354310] [2022-11-19 08:13:30,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428354310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:30,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:30,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:13:30,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499569236] [2022-11-19 08:13:30,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:30,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:13:30,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:30,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:13:30,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:13:30,920 INFO L87 Difference]: Start difference. First operand 1350 states and 1630 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-19 08:13:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:31,020 INFO L93 Difference]: Finished difference Result 1335 states and 1608 transitions. [2022-11-19 08:13:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:13:31,021 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-19 08:13:31,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:31,027 INFO L225 Difference]: With dead ends: 1335 [2022-11-19 08:13:31,027 INFO L226 Difference]: Without dead ends: 1335 [2022-11-19 08:13:31,028 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-19 08:13:31,029 INFO L413 NwaCegarLoop]: 1128 mSDtfsCounter, 1114 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 2282 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-19 08:13:31,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 2282 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:13:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-11-19 08:13:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1328. [2022-11-19 08:13:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 819 states have (on average 1.9157509157509158) internal successors, (1569), 1319 states have internal predecessors, (1569), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1601 transitions. [2022-11-19 08:13:31,066 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1601 transitions. Word has length 13 [2022-11-19 08:13:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:31,066 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 1601 transitions. [2022-11-19 08:13:31,067 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-19 08:13:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1601 transitions. [2022-11-19 08:13:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 08:13:31,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:31,068 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-19 08:13:31,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:31,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:31,280 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:31,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-19 08:13:31,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:31,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856461891] [2022-11-19 08:13:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:31,282 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-19 08:13:31,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:31,283 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:31,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:31,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:13:31,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:31,490 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-19 08:13:31,602 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-19 08:13:31,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:31,603 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:31,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856461891] [2022-11-19 08:13:31,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856461891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:31,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:31,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:13:31,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437100288] [2022-11-19 08:13:31,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:31,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:13:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:31,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:13:31,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:13:31,608 INFO L87 Difference]: Start difference. First operand 1328 states and 1601 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-19 08:13:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:35,825 INFO L93 Difference]: Finished difference Result 1788 states and 2048 transitions. [2022-11-19 08:13:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:13:35,825 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-19 08:13:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:35,832 INFO L225 Difference]: With dead ends: 1788 [2022-11-19 08:13:35,832 INFO L226 Difference]: Without dead ends: 1788 [2022-11-19 08:13:35,833 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-19 08:13:35,834 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 2384 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:35,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2397 Valid, 1001 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-19 08:13:35,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2022-11-19 08:13:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1324. [2022-11-19 08:13:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 819 states have (on average 1.910866910866911) internal successors, (1565), 1315 states have internal predecessors, (1565), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1597 transitions. [2022-11-19 08:13:35,873 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1597 transitions. Word has length 27 [2022-11-19 08:13:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:35,873 INFO L495 AbstractCegarLoop]: Abstraction has 1324 states and 1597 transitions. [2022-11-19 08:13:35,874 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-19 08:13:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1597 transitions. [2022-11-19 08:13:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 08:13:35,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:35,875 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-19 08:13:35,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:36,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:36,089 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:36,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-19 08:13:36,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:36,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726346146] [2022-11-19 08:13:36,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:36,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:13:36,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:36,092 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:36,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:36,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:13:36,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:36,327 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-19 08:13:36,534 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-19 08:13:36,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:36,535 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:36,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726346146] [2022-11-19 08:13:36,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726346146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:36,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:36,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:13:36,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151768314] [2022-11-19 08:13:36,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:36,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:13:36,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:36,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:13:36,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:13:36,536 INFO L87 Difference]: Start difference. First operand 1324 states and 1597 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-19 08:13:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:41,515 INFO L93 Difference]: Finished difference Result 1508 states and 1671 transitions. [2022-11-19 08:13:41,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:13:41,516 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-19 08:13:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:41,522 INFO L225 Difference]: With dead ends: 1508 [2022-11-19 08:13:41,522 INFO L226 Difference]: Without dead ends: 1508 [2022-11-19 08:13:41,522 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-19 08:13:41,523 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 851 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:41,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1911 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-19 08:13:41,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-11-19 08:13:41,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1320. [2022-11-19 08:13:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 819 states have (on average 1.9059829059829059) internal successors, (1561), 1311 states have internal predecessors, (1561), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1593 transitions. [2022-11-19 08:13:41,549 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1593 transitions. Word has length 27 [2022-11-19 08:13:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:41,550 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1593 transitions. [2022-11-19 08:13:41,550 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-19 08:13:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1593 transitions. [2022-11-19 08:13:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-19 08:13:41,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:41,551 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] [2022-11-19 08:13:41,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-19 08:13:41,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:41,764 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:41,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-19 08:13:41,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:41,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431234846] [2022-11-19 08:13:41,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:41,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:13:41,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:41,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:41,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:42,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:13:42,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:42,084 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-19 08:13:42,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:42,084 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:42,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431234846] [2022-11-19 08:13:42,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431234846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:42,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:42,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:13:42,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040984168] [2022-11-19 08:13:42,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:42,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:13:42,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:42,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:13:42,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:13:42,087 INFO L87 Difference]: Start difference. First operand 1320 states and 1593 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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-19 08:13:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:42,171 INFO L93 Difference]: Finished difference Result 1320 states and 1589 transitions. [2022-11-19 08:13:42,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:13:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-11-19 08:13:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:42,176 INFO L225 Difference]: With dead ends: 1320 [2022-11-19 08:13:42,176 INFO L226 Difference]: Without dead ends: 1320 [2022-11-19 08:13:42,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-19 08:13:42,177 INFO L413 NwaCegarLoop]: 1122 mSDtfsCounter, 1083 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 2260 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-19 08:13:42,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 2260 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:13:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2022-11-19 08:13:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1314. [2022-11-19 08:13:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 813 states have (on average 1.9077490774907748) internal successors, (1551), 1305 states have internal predecessors, (1551), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1583 transitions. [2022-11-19 08:13:42,202 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1583 transitions. Word has length 42 [2022-11-19 08:13:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:42,203 INFO L495 AbstractCegarLoop]: Abstraction has 1314 states and 1583 transitions. [2022-11-19 08:13:42,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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-19 08:13:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1583 transitions. [2022-11-19 08:13:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-19 08:13:42,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:42,204 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] [2022-11-19 08:13:42,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:42,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:42,418 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:42,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:42,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-19 08:13:42,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:42,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282335601] [2022-11-19 08:13:42,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:42,420 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-19 08:13:42,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:42,421 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:42,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:42,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:13:42,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:42,946 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-19 08:13:42,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:42,947 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:42,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282335601] [2022-11-19 08:13:42,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282335601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:42,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:42,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:13:42,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657628935] [2022-11-19 08:13:42,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:42,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:13:42,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:42,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:13:42,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:13:42,948 INFO L87 Difference]: Start difference. First operand 1314 states and 1583 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:43,034 INFO L93 Difference]: Finished difference Result 1360 states and 1629 transitions. [2022-11-19 08:13:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:13:43,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-11-19 08:13:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:43,040 INFO L225 Difference]: With dead ends: 1360 [2022-11-19 08:13:43,040 INFO L226 Difference]: Without dead ends: 1360 [2022-11-19 08:13:43,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-19 08:13:43,041 INFO L413 NwaCegarLoop]: 1130 mSDtfsCounter, 67 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:43,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2165 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:13:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-11-19 08:13:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2022-11-19 08:13:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 859 states have (on average 1.859138533178114) internal successors, (1597), 1351 states have internal predecessors, (1597), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1629 transitions. [2022-11-19 08:13:43,065 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1629 transitions. Word has length 50 [2022-11-19 08:13:43,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:43,065 INFO L495 AbstractCegarLoop]: Abstraction has 1360 states and 1629 transitions. [2022-11-19 08:13:43,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:43,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1629 transitions. [2022-11-19 08:13:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-19 08:13:43,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:43,067 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] [2022-11-19 08:13:43,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:43,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:43,280 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:43,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:43,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-19 08:13:43,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:43,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258461722] [2022-11-19 08:13:43,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:43,282 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-19 08:13:43,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:43,283 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:43,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:43,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 08:13:43,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:43,726 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-19 08:13:43,733 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-19 08:13:44,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:13:44,264 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-19 08:13:44,288 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:13:44,289 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-19 08:13:44,321 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-19 08:13:44,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:44,321 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:44,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258461722] [2022-11-19 08:13:44,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258461722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:44,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:44,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:13:44,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33103252] [2022-11-19 08:13:44,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:44,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:13:44,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:44,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:13:44,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:13:44,325 INFO L87 Difference]: Start difference. First operand 1360 states and 1629 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:47,651 INFO L93 Difference]: Finished difference Result 1329 states and 1552 transitions. [2022-11-19 08:13:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:13:47,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-11-19 08:13:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:47,656 INFO L225 Difference]: With dead ends: 1329 [2022-11-19 08:13:47,656 INFO L226 Difference]: Without dead ends: 1329 [2022-11-19 08:13:47,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 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-19 08:13:47,657 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 1095 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:47,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 526 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-19 08:13:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-11-19 08:13:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1110. [2022-11-19 08:13:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 693 states have (on average 1.725829725829726) internal successors, (1196), 1101 states have internal predecessors, (1196), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1228 transitions. [2022-11-19 08:13:47,676 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1228 transitions. Word has length 53 [2022-11-19 08:13:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:47,677 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1228 transitions. [2022-11-19 08:13:47,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1228 transitions. [2022-11-19 08:13:47,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-19 08:13:47,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:47,678 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] [2022-11-19 08:13:47,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:47,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:47,892 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:47,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:47,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-19 08:13:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:47,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883117799] [2022-11-19 08:13:47,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:47,893 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-19 08:13:47,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:47,895 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:47,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:48,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:13:48,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:48,203 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-19 08:13:48,219 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-19 08:13:48,253 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-19 08:13:48,267 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-19 08:13:48,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:48,267 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:48,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883117799] [2022-11-19 08:13:48,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883117799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:48,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:48,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:13:48,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334101392] [2022-11-19 08:13:48,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:48,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:13:48,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:48,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:13:48,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:13:48,270 INFO L87 Difference]: Start difference. First operand 1110 states and 1228 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:51,999 INFO L93 Difference]: Finished difference Result 1109 states and 1227 transitions. [2022-11-19 08:13:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:13:51,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-19 08:13:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:52,003 INFO L225 Difference]: With dead ends: 1109 [2022-11-19 08:13:52,003 INFO L226 Difference]: Without dead ends: 1109 [2022-11-19 08:13:52,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 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-19 08:13:52,004 INFO L413 NwaCegarLoop]: 1042 mSDtfsCounter, 4 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:52,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2633 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-19 08:13:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-11-19 08:13:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2022-11-19 08:13:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 693 states have (on average 1.7243867243867244) internal successors, (1195), 1100 states have internal predecessors, (1195), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1227 transitions. [2022-11-19 08:13:52,022 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1227 transitions. Word has length 58 [2022-11-19 08:13:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:52,023 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1227 transitions. [2022-11-19 08:13:52,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1227 transitions. [2022-11-19 08:13:52,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-19 08:13:52,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:52,024 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] [2022-11-19 08:13:52,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:52,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:52,238 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:52,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-19 08:13:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:52,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576208888] [2022-11-19 08:13:52,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:52,239 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-19 08:13:52,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:52,240 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:52,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:52,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 08:13:52,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:52,607 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-19 08:13:52,641 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-19 08:13:52,654 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-19 08:13:52,718 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-19 08:13:52,726 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-19 08:13:52,744 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-19 08:13:52,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:52,744 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:52,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576208888] [2022-11-19 08:13:52,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576208888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:52,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:52,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:13:52,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253349152] [2022-11-19 08:13:52,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:52,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:13:52,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:52,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:13:52,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:13:52,746 INFO L87 Difference]: Start difference. First operand 1109 states and 1227 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:57,648 INFO L93 Difference]: Finished difference Result 1108 states and 1226 transitions. [2022-11-19 08:13:57,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:13:57,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-19 08:13:57,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:57,653 INFO L225 Difference]: With dead ends: 1108 [2022-11-19 08:13:57,653 INFO L226 Difference]: Without dead ends: 1108 [2022-11-19 08:13:57,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 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-19 08:13:57,654 INFO L413 NwaCegarLoop]: 1042 mSDtfsCounter, 2 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:57,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2656 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-19 08:13:57,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2022-11-19 08:13:57,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2022-11-19 08:13:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 692 states have (on average 1.7254335260115607) internal successors, (1194), 1099 states have internal predecessors, (1194), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 08:13:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1226 transitions. [2022-11-19 08:13:57,673 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1226 transitions. Word has length 58 [2022-11-19 08:13:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:57,674 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1226 transitions. [2022-11-19 08:13:57,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1226 transitions. [2022-11-19 08:13:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-19 08:13:57,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:57,676 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] [2022-11-19 08:13:57,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:57,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:57,891 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:57,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:57,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2038939938, now seen corresponding path program 1 times [2022-11-19 08:13:57,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:57,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028512929] [2022-11-19 08:13:57,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:57,892 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-19 08:13:57,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:57,893 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:57,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:58,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:13:58,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:58,279 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-19 08:13:58,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:13:58,280 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:58,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028512929] [2022-11-19 08:13:58,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028512929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:58,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:58,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:13:58,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261101531] [2022-11-19 08:13:58,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:58,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:13:58,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:58,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:13:58,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:13:58,285 INFO L87 Difference]: Start difference. First operand 1108 states and 1226 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-19 08:13:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:58,390 INFO L93 Difference]: Finished difference Result 1111 states and 1231 transitions. [2022-11-19 08:13:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:13:58,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 66 [2022-11-19 08:13:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:58,395 INFO L225 Difference]: With dead ends: 1111 [2022-11-19 08:13:58,395 INFO L226 Difference]: Without dead ends: 1111 [2022-11-19 08:13:58,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-19 08:13:58,396 INFO L413 NwaCegarLoop]: 1041 mSDtfsCounter, 2 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3115 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-19 08:13:58,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3115 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:13:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-11-19 08:13:58,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2022-11-19 08:13:58,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 694 states have (on average 1.7247838616714697) internal successors, (1197), 1102 states have internal predecessors, (1197), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-19 08:13:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1231 transitions. [2022-11-19 08:13:58,418 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1231 transitions. Word has length 66 [2022-11-19 08:13:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:58,418 INFO L495 AbstractCegarLoop]: Abstraction has 1111 states and 1231 transitions. [2022-11-19 08:13:58,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-19 08:13:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1231 transitions. [2022-11-19 08:13:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 08:13:58,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:58,419 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-19 08:13:58,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:58,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:58,634 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:13:58,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:58,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2031497853, now seen corresponding path program 1 times [2022-11-19 08:13:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:13:58,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096129121] [2022-11-19 08:13:58,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:58,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-19 08:13:58,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:13:58,639 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:58,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:13:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:59,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:13:59,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:59,041 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-19 08:13:59,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:13:59,161 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-19 08:13:59,161 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:13:59,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096129121] [2022-11-19 08:13:59,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096129121] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:13:59,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1374317298] [2022-11-19 08:13:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:59,162 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:13:59,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:13:59,169 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:13:59,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-19 08:13:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:59,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:13:59,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:59,783 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-19 08:13:59,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:13:59,834 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-19 08:13:59,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1374317298] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:13:59,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336457772] [2022-11-19 08:13:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:59,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:13:59,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:13:59,838 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:13:59,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-19 08:14:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:00,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:14:00,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:00,198 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-19 08:14:00,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:00,265 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-19 08:14:00,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336457772] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:00,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:14:00,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-19 08:14:00,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828987799] [2022-11-19 08:14:00,266 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:14:00,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:14:00,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:14:00,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:14:00,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:14:00,267 INFO L87 Difference]: Start difference. First operand 1111 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-19 08:14:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:00,592 INFO L93 Difference]: Finished difference Result 1123 states and 1249 transitions. [2022-11-19 08:14:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:14:00,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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 67 [2022-11-19 08:14:00,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:00,598 INFO L225 Difference]: With dead ends: 1123 [2022-11-19 08:14:00,598 INFO L226 Difference]: Without dead ends: 1123 [2022-11-19 08:14:00,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-19 08:14:00,599 INFO L413 NwaCegarLoop]: 1041 mSDtfsCounter, 14 mSDsluCounter, 5172 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6213 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:00,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6213 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:14:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-11-19 08:14:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1121. [2022-11-19 08:14:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 703 states have (on average 1.7240398293029873) internal successors, (1212), 1111 states have internal predecessors, (1212), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-19 08:14:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1246 transitions. [2022-11-19 08:14:00,625 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1246 transitions. Word has length 67 [2022-11-19 08:14:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:00,626 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 1246 transitions. [2022-11-19 08:14:00,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-19 08:14:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1246 transitions. [2022-11-19 08:14:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-19 08:14:00,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:00,627 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] [2022-11-19 08:14:00,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:00,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:01,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:01,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:01,240 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:14:01,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:01,241 INFO L85 PathProgramCache]: Analyzing trace with hash 942124702, now seen corresponding path program 2 times [2022-11-19 08:14:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:14:01,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755070514] [2022-11-19 08:14:01,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:14:01,242 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-19 08:14:01,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:14:01,244 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:14:01,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:14:01,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:14:01,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:14:01,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:14:01,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:01,806 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-19 08:14:01,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:02,062 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-19 08:14:02,063 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:14:02,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755070514] [2022-11-19 08:14:02,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755070514] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:02,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [409033608] [2022-11-19 08:14:02,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:14:02,064 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:14:02,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:14:02,065 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:14:02,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-19 08:14:03,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:14:03,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:14:03,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:14:03,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:03,447 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-19 08:14:03,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:03,539 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-19 08:14:03,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [409033608] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:03,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10647452] [2022-11-19 08:14:03,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:14:03,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:03,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:14:03,545 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:14:03,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-19 08:14:22,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:14:22,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:14:22,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 08:14:22,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:22,466 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:14:22,466 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-19 08:14:22,513 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-19 08:14:22,981 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:14:22,981 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-19 08:14:23,092 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-19 08:14:23,143 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-19 08:14:23,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:23,297 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-19 08:14:23,298 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-19 08:14:23,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10647452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:14:23,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-19 08:14:23,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-19 08:14:23,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189994886] [2022-11-19 08:14:23,424 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-19 08:14:23,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-19 08:14:23,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:14:23,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-19 08:14:23,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=551, Unknown=9, NotChecked=0, Total=650 [2022-11-19 08:14:23,425 INFO L87 Difference]: Start difference. First operand 1121 states and 1246 transitions. Second operand has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 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-19 08:14:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:47,565 INFO L93 Difference]: Finished difference Result 2117 states and 2276 transitions. [2022-11-19 08:14:47,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-19 08:14:47,566 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 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 70 [2022-11-19 08:14:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:47,573 INFO L225 Difference]: With dead ends: 2117 [2022-11-19 08:14:47,573 INFO L226 Difference]: Without dead ends: 2117 [2022-11-19 08:14:47,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=320, Invalid=1998, Unknown=34, NotChecked=0, Total=2352 [2022-11-19 08:14:47,575 INFO L413 NwaCegarLoop]: 839 mSDtfsCounter, 2149 mSDsluCounter, 11203 mSDsCounter, 0 mSdLazyCounter, 11280 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 12042 SdHoareTripleChecker+Invalid, 12261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 11280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 920 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:47,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 12042 Invalid, 12261 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 11280 Invalid, 0 Unknown, 920 Unchecked, 22.6s Time] [2022-11-19 08:14:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2022-11-19 08:14:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 1127. [2022-11-19 08:14:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 709 states have (on average 1.7235543018335684) internal successors, (1222), 1117 states have internal predecessors, (1222), 16 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (19), 7 states have call predecessors, (19), 16 states have call successors, (19) [2022-11-19 08:14:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1257 transitions. [2022-11-19 08:14:47,599 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1257 transitions. Word has length 70 [2022-11-19 08:14:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:47,599 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 1257 transitions. [2022-11-19 08:14:47,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 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-19 08:14:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1257 transitions. [2022-11-19 08:14:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-19 08:14:47,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:47,601 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:14:47,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:47,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:48,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:14:48,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:14:48,222 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:14:48,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:48,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1298849026, now seen corresponding path program 1 times [2022-11-19 08:14:48,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:14:48,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235667780] [2022-11-19 08:14:48,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:48,224 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-19 08:14:48,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:14:48,225 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:14:48,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:14:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:48,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 08:14:48,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:48,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:49,428 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:14:49,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235667780] [2022-11-19 08:14:49,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235667780] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:49,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1056734692] [2022-11-19 08:14:49,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:49,429 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:14:49,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:14:49,430 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:14:49,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-19 08:14:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:50,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 08:14:50,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:50,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:50,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1056734692] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:50,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972164879] [2022-11-19 08:14:50,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:50,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:50,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:14:50,344 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:14:50,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-19 08:14:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:50,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-19 08:14:50,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:50,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:51,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972164879] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:51,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:14:51,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 13] total 35 [2022-11-19 08:14:51,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744287867] [2022-11-19 08:14:51,797 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:14:51,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 08:14:51,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:14:51,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 08:14:51,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=808, Unknown=0, NotChecked=0, Total=1190 [2022-11-19 08:14:51,800 INFO L87 Difference]: Start difference. First operand 1127 states and 1257 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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-19 08:14:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:55,784 INFO L93 Difference]: Finished difference Result 1176 states and 1325 transitions. [2022-11-19 08:14:55,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-19 08:14:55,785 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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 75 [2022-11-19 08:14:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:55,790 INFO L225 Difference]: With dead ends: 1176 [2022-11-19 08:14:55,790 INFO L226 Difference]: Without dead ends: 1160 [2022-11-19 08:14:55,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1371, Invalid=2789, Unknown=0, NotChecked=0, Total=4160 [2022-11-19 08:14:55,793 INFO L413 NwaCegarLoop]: 1046 mSDtfsCounter, 227 mSDsluCounter, 14530 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 15576 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:55,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 15576 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-19 08:14:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2022-11-19 08:14:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1144. [2022-11-19 08:14:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 727 states have (on average 1.7083906464924348) internal successors, (1242), 1134 states have internal predecessors, (1242), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-19 08:14:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1276 transitions. [2022-11-19 08:14:55,814 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1276 transitions. Word has length 75 [2022-11-19 08:14:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:55,814 INFO L495 AbstractCegarLoop]: Abstraction has 1144 states and 1276 transitions. [2022-11-19 08:14:55,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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-19 08:14:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1276 transitions. [2022-11-19 08:14:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-19 08:14:55,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:55,816 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:14:55,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2022-11-19 08:14:56,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-19 08:14:56,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:14:56,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:14:56,422 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:14:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash 47885727, now seen corresponding path program 2 times [2022-11-19 08:14:56,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:14:56,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411659191] [2022-11-19 08:14:56,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:14:56,423 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-19 08:14:56,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:14:56,424 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:14:56,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:14:57,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:14:57,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:14:57,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-19 08:14:57,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:57,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:15:01,758 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:15:01,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411659191] [2022-11-19 08:15:01,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411659191] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:15:01,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [299803622] [2022-11-19 08:15:01,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:15:01,758 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:15:01,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:15:01,759 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:15:01,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-19 08:15:03,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:15:03,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:15:03,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-19 08:15:03,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:15:03,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:15:05,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [299803622] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:15:05,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451106016] [2022-11-19 08:15:05,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:15:05,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:05,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:15:05,072 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:15:05,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-19 08:15:17,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:15:17,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:15:17,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-19 08:15:17,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:17,657 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-19 08:15:17,671 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:15:17,672 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-19 08:15:17,797 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-19 08:15:17,807 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-19 08:15:18,235 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-19 08:15:18,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-19 08:15:18,430 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2317 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2317))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2318) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:15:18,446 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2319))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2320) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:15:18,463 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2322) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2321 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2321)))) is different from true [2022-11-19 08:15:18,480 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2324))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2323)))) is different from true [2022-11-19 08:15:18,497 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2326) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2325) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:15:18,736 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2329) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2330 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2330)))) is different from true [2022-11-19 08:15:18,752 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2331))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2332)))) is different from true [2022-11-19 08:15:18,767 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2334) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2333)))) is different from true [2022-11-19 08:15:18,782 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2335) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2336)))) is different from true [2022-11-19 08:15:18,800 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2338))) (exists ((v_ArrVal_2337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2337)))) is different from true [2022-11-19 08:15:18,814 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2339))) (exists ((v_ArrVal_2340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2340))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-19 08:15:18,828 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2341) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2342)))) is different from true [2022-11-19 08:15:18,843 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2343))) (exists ((v_ArrVal_2344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2344) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:15:18,858 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2346))) (exists ((v_ArrVal_2345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2345) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-19 08:15:18,873 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2348))) (exists ((v_ArrVal_2347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2347)))) is different from true [2022-11-19 08:15:18,887 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2349))) (exists ((v_ArrVal_2350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2350) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-19 08:15:18,900 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2351))) (exists ((v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2352)))) is different from true [2022-11-19 08:15:18,915 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2353) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2354)))) is different from true [2022-11-19 08:15:18,929 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2355))) (exists ((v_ArrVal_2356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2356) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-19 08:15:18,980 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:15:18,980 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-19 08:15:18,988 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-19 08:15:19,220 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-19 08:15:19,233 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-19 08:15:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 209 not checked. [2022-11-19 08:15:19,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:20,264 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2400) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2399) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2400 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2400) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2022-11-19 08:15:20,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451106016] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:20,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-19 08:15:20,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24, 24, 28] total 73 [2022-11-19 08:15:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529889126] [2022-11-19 08:15:20,271 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-19 08:15:20,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-19 08:15:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:15:20,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-19 08:15:20,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=2479, Unknown=44, NotChecked=2540, Total=5700 [2022-11-19 08:15:20,278 INFO L87 Difference]: Start difference. First operand 1144 states and 1276 transitions. Second operand has 73 states, 72 states have (on average 2.5416666666666665) internal successors, (183), 73 states have internal predecessors, (183), 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-19 08:15:42,926 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (bvult (bvadd (_ bv2 32) |c_#Ultimate.C_memset_#t~loopctr273|) |c_#Ultimate.C_memset_#amount|)) (.cse6 (bvult (bvadd (_ bv4 32) |c_#Ultimate.C_memset_#t~loopctr273|) |c_#Ultimate.C_memset_#amount|)) (.cse2 (bvult (bvadd (_ bv3 32) |c_#Ultimate.C_memset_#t~loopctr273|) |c_#Ultimate.C_memset_#amount|)) (.cse4 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr273| (_ bv7 32)) |c_#Ultimate.C_memset_#amount|)) (.cse3 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr273| (_ bv1 32)) |c_#Ultimate.C_memset_#amount|)) (.cse8 (bvult |c_#Ultimate.C_memset_#t~loopctr273| |c_#Ultimate.C_memset_#amount|)) (.cse5 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr273| (_ bv5 32)) |c_#Ultimate.C_memset_#amount|)) (.cse0 (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32)))) (.cse7 (bvult (bvadd (_ bv6 32) |c_#Ultimate.C_memset_#t~loopctr273|) |c_#Ultimate.C_memset_#amount|))) (and (or .cse0 (not .cse1) .cse2) (exists ((v_ArrVal_2331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2331))) (or .cse1 .cse0 (not .cse3)) (or .cse0 (bvult (bvadd (_ bv8 32) |c_#Ultimate.C_memset_#t~loopctr273|) |c_#Ultimate.C_memset_#amount|) (not .cse4)) (exists ((v_ArrVal_2339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2339))) (exists ((v_ArrVal_2353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2346))) (exists ((v_ArrVal_2340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2340))) (exists ((v_ArrVal_2334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2334) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2355))) (exists ((v_ArrVal_2349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2349))) (exists ((v_ArrVal_2350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2350) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2356) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2345) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2335) |c_#memory_$Pointer$.offset|)) (or .cse0 .cse5 (not .cse6)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2354))) (exists ((v_ArrVal_2351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2351))) (exists ((v_ArrVal_2329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2329) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2338))) (or .cse0 .cse6 (not .cse2)) (or .cse0 (not .cse7) .cse4) (exists ((v_ArrVal_2333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2333))) (or .cse0 .cse8) (exists ((v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2348))) (exists ((v_ArrVal_2341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2341) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2342))) (exists ((v_ArrVal_2343 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2343))) (exists ((v_ArrVal_2344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2344) |c_#memory_$Pointer$.offset|)) (or .cse3 (not .cse8) .cse0) (exists ((v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2352))) (or (not .cse5) .cse0 .cse7) (exists ((v_ArrVal_2337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2337))) (exists ((v_ArrVal_2336 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2336))) (exists ((v_ArrVal_2330 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2330))) (exists ((v_ArrVal_2332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2332))) (exists ((v_ArrVal_2347 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2347))))) is different from true [2022-11-19 08:17:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:16,713 INFO L93 Difference]: Finished difference Result 2248 states and 2523 transitions. [2022-11-19 08:17:16,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-11-19 08:17:16,715 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 2.5416666666666665) internal successors, (183), 73 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 86 [2022-11-19 08:17:16,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:16,722 INFO L225 Difference]: With dead ends: 2248 [2022-11-19 08:17:16,723 INFO L226 Difference]: Without dead ends: 2236 [2022-11-19 08:17:16,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 348 SyntacticMatches, 12 SemanticMatches, 165 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 5671 ImplicationChecksByTransitivity, 48.8s TimeCoverageRelationStatistics Valid=4556, Invalid=16081, Unknown=617, NotChecked=6468, Total=27722 [2022-11-19 08:17:16,730 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 2305 mSDsluCounter, 24293 mSDsCounter, 0 mSdLazyCounter, 31902 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2378 SdHoareTripleChecker+Valid, 25243 SdHoareTripleChecker+Invalid, 76908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 31902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44815 IncrementalHoareTripleChecker+Unchecked, 71.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:16,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2378 Valid, 25243 Invalid, 76908 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [191 Valid, 31902 Invalid, 0 Unknown, 44815 Unchecked, 71.7s Time] [2022-11-19 08:17:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2022-11-19 08:17:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 1221. [2022-11-19 08:17:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 804 states have (on average 1.650497512437811) internal successors, (1327), 1210 states have internal predecessors, (1327), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-19 08:17:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1361 transitions. [2022-11-19 08:17:16,766 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1361 transitions. Word has length 86 [2022-11-19 08:17:16,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:16,766 INFO L495 AbstractCegarLoop]: Abstraction has 1221 states and 1361 transitions. [2022-11-19 08:17:16,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 2.5416666666666665) internal successors, (183), 73 states have internal predecessors, (183), 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-19 08:17:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1361 transitions. [2022-11-19 08:17:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-19 08:17:16,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:16,768 INFO L195 NwaCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:17:16,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:16,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:17:17,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:17,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 08:17:17,384 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:17:17,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:17,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1843447000, now seen corresponding path program 1 times [2022-11-19 08:17:17,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:17:17,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977740726] [2022-11-19 08:17:17,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:17,386 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-19 08:17:17,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:17:17,387 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:17:17,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:17:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:17,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-19 08:17:17,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:17:19,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:17:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:17:26,027 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:17:26,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977740726] [2022-11-19 08:17:26,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977740726] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:17:26,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1905756182] [2022-11-19 08:17:26,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:26,028 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:17:26,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:17:26,029 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:17:26,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-19 08:17:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:27,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-19 08:17:27,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:17:27,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:17:28,716 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:17:28,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1905756182] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:17:28,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064784627] [2022-11-19 08:17:28,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:28,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:28,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:28,718 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:28,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-19 08:17:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:29,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-19 08:17:29,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:17:29,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:17:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:17:42,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064784627] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:17:42,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:17:42,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45, 45, 45, 45] total 131 [2022-11-19 08:17:42,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058106267] [2022-11-19 08:17:42,314 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:17:42,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-11-19 08:17:42,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:17:42,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-11-19 08:17:42,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4083, Invalid=12947, Unknown=0, NotChecked=0, Total=17030 [2022-11-19 08:17:42,321 INFO L87 Difference]: Start difference. First operand 1221 states and 1361 transitions. Second operand has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 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-19 08:19:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:19:04,789 INFO L93 Difference]: Finished difference Result 1414 states and 1694 transitions. [2022-11-19 08:19:04,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-11-19 08:19:04,792 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 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 110 [2022-11-19 08:19:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:19:04,807 INFO L225 Difference]: With dead ends: 1414 [2022-11-19 08:19:04,808 INFO L226 Difference]: Without dead ends: 1404 [2022-11-19 08:19:04,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7404 ImplicationChecksByTransitivity, 78.2s TimeCoverageRelationStatistics Valid=18292, Invalid=46478, Unknown=0, NotChecked=0, Total=64770 [2022-11-19 08:19:04,818 INFO L413 NwaCegarLoop]: 1075 mSDtfsCounter, 1081 mSDsluCounter, 52209 mSDsCounter, 0 mSdLazyCounter, 9480 mSolverCounterSat, 1284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 53284 SdHoareTripleChecker+Invalid, 10764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1284 IncrementalHoareTripleChecker+Valid, 9480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:19:04,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 53284 Invalid, 10764 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1284 Valid, 9480 Invalid, 0 Unknown, 0 Unchecked, 20.9s Time] [2022-11-19 08:19:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-11-19 08:19:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1328. [2022-11-19 08:19:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 911 states have (on average 1.5982436882546651) internal successors, (1456), 1317 states have internal predecessors, (1456), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-19 08:19:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1490 transitions. [2022-11-19 08:19:04,853 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1490 transitions. Word has length 110 [2022-11-19 08:19:04,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:19:04,854 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 1490 transitions. [2022-11-19 08:19:04,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 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-19 08:19:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1490 transitions. [2022-11-19 08:19:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-19 08:19:04,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:19:04,857 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] [2022-11-19 08:19:04,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:19:05,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-19 08:19:05,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-19 08:19:05,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 08:19:05,482 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:19:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:19:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash -239903209, now seen corresponding path program 2 times [2022-11-19 08:19:05,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:19:05,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48278752] [2022-11-19 08:19:05,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:19:05,484 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-19 08:19:05,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:19:05,485 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:19:05,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:19:06,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 08:19:06,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:19:06,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 08:19:06,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:19:06,314 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-19 08:19:06,314 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 39 treesize of output 29 [2022-11-19 08:19:06,389 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-19 08:19:06,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2022-11-19 08:19:06,413 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-19 08:19:06,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:19:06,413 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:19:06,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48278752] [2022-11-19 08:19:06,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48278752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:19:06,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:19:06,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:19:06,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679549791] [2022-11-19 08:19:06,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:19:06,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:19:06,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:19:06,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:19:06,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:19:06,416 INFO L87 Difference]: Start difference. First operand 1328 states and 1490 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-19 08:19:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:19:10,617 INFO L93 Difference]: Finished difference Result 2200 states and 2460 transitions. [2022-11-19 08:19:10,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:19:10,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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 113 [2022-11-19 08:19:10,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:19:10,623 INFO L225 Difference]: With dead ends: 2200 [2022-11-19 08:19:10,623 INFO L226 Difference]: Without dead ends: 2200 [2022-11-19 08:19:10,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:19:10,624 INFO L413 NwaCegarLoop]: 1375 mSDtfsCounter, 871 mSDsluCounter, 2487 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 3862 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 488 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:19:10,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 3862 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1411 Invalid, 0 Unknown, 488 Unchecked, 4.1s Time] [2022-11-19 08:19:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2022-11-19 08:19:10,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 1327. [2022-11-19 08:19:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 911 states have (on average 1.597145993413831) internal successors, (1455), 1316 states have internal predecessors, (1455), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-19 08:19:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1489 transitions. [2022-11-19 08:19:10,651 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1489 transitions. Word has length 113 [2022-11-19 08:19:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:19:10,651 INFO L495 AbstractCegarLoop]: Abstraction has 1327 states and 1489 transitions. [2022-11-19 08:19:10,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-19 08:19:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1489 transitions. [2022-11-19 08:19:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-19 08:19:10,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:19:10,653 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] [2022-11-19 08:19:10,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-19 08:19:10,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:19:10,869 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-19 08:19:10,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:19:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash -239903208, now seen corresponding path program 1 times [2022-11-19 08:19:10,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:19:10,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396050237] [2022-11-19 08:19:10,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:19:10,871 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-19 08:19:10,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:19:10,872 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -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-19 08:19:10,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-19 08:19:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:19:11,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-19 08:19:12,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:19:12,014 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-19 08:19:12,132 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-19 08:19:12,145 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:19:12,146 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-19 08:19:12,171 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-19 08:19:12,188 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-19 08:19:12,307 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-19 08:19:12,324 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-19 08:19:12,414 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4146))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4147 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4147) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:19:12,429 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149))) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:19:12,443 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151)))) is different from true [2022-11-19 08:19:12,458 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153)))) is different from true [2022-11-19 08:19:12,473 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4155 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4155) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4154) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:19:12,491 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156)))) is different from true [2022-11-19 08:19:12,612 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164)))) is different from true [2022-11-19 08:19:12,625 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4167) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4166)))) is different from true [2022-11-19 08:19:12,639 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169))) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168)))) is different from true [2022-11-19 08:19:12,652 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:19:12,665 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172)))) is different from true [2022-11-19 08:19:12,678 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174))) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175)))) is different from true [2022-11-19 08:19:12,703 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176)))) is different from true [2022-11-19 08:19:12,718 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:19:12,733 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181)))) is different from true [2022-11-19 08:19:12,748 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:19:12,763 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184)))) is different from true [2022-11-19 08:19:12,778 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186)))) is different from true [2022-11-19 08:19:12,793 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189)))) is different from true [2022-11-19 08:19:12,808 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4190) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4191)))) is different from true [2022-11-19 08:19:12,823 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193)))) is different from true [2022-11-19 08:19:12,838 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195)))) is different from true [2022-11-19 08:19:12,853 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:19:12,868 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4199))) (exists ((v_ArrVal_4198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4198))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:19:12,886 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4200))) (exists ((v_ArrVal_4201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4201)))) is different from true [2022-11-19 08:19:12,911 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203)))) is different from true [2022-11-19 08:19:12,927 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205))) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204)))) is different from true [2022-11-19 08:19:12,941 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4206) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4207) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:19:12,957 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4209 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4209) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4208) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:19:12,973 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4210) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:19:12,988 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213)))) is different from true [2022-11-19 08:19:13,004 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215))) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214)))) is different from true [2022-11-19 08:19:13,019 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216)))) is different from true [2022-11-19 08:19:13,033 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218)))) is different from true [2022-11-19 08:19:13,047 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:19:13,061 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223)))) is different from true [2022-11-19 08:19:13,075 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225)))) is different from true [2022-11-19 08:19:13,089 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:19:13,123 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229)))) is different from true [2022-11-19 08:19:13,145 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4230 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4230)))) is different from true [2022-11-19 08:19:13,160 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233)))) is different from true [2022-11-19 08:19:13,219 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:19:13,220 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-19 08:19:13,235 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-19 08:19:13,362 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:19:13,362 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-19 08:19:13,371 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-19 08:19:13,407 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-19 08:19:13,411 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-19 08:19:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2022-11-19 08:19:13,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:19:13,703 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4235) |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~mem35#1.base| v_ArrVal_4234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-19 08:19:13,761 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 08:19:14,840 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4326) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4327))) (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~mem33#1.base| v_ArrVal_4326) .cse2 v_ArrVal_4235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-19 08:19:14,853 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:19:14,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396050237] [2022-11-19 08:19:14,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396050237] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:19:14,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [150177693] [2022-11-19 08:19:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:19:14,854 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:19:14,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:19:14,855 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:19:14,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-19 08:21:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:24,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-19 08:21:24,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:24,039 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-19 08:21:24,166 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-19 08:21:24,180 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:21:24,180 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-19 08:21:24,197 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-19 08:21:24,211 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-19 08:21:24,285 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-19 08:21:24,291 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-19 08:21:24,350 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4692 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4692))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4693 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4693)))) is different from true [2022-11-19 08:21:24,363 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4694 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4694)))) is different from true [2022-11-19 08:21:24,378 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4697 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4697))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696)))) is different from true [2022-11-19 08:21:24,393 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4698 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4698) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:24,408 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4700 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4700))) (exists ((v_ArrVal_4701 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4701)))) is different from true [2022-11-19 08:21:24,424 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4703 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4703))) (exists ((v_ArrVal_4702 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4702)))) is different from true [2022-11-19 08:21:24,439 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4704 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4704)))) is different from true [2022-11-19 08:21:24,454 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707)))) is different from true [2022-11-19 08:21:24,470 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:21:24,502 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4710) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4711)))) is different from true [2022-11-19 08:21:24,518 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712)))) is different from true [2022-11-19 08:21:24,534 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4714) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4715 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4715))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:21:24,551 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4717) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4716 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4716) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:24,566 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719)))) is different from true [2022-11-19 08:21:24,582 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4721) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4720) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:24,598 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4723) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4722))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:21:24,614 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725)))) is different from true [2022-11-19 08:21:24,629 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4727 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4727) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4726 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4726)))) is different from true [2022-11-19 08:21:24,645 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4728))) (exists ((v_ArrVal_4729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4729)))) is different from true [2022-11-19 08:21:24,661 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4731) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4730) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:24,676 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4732))) (exists ((v_ArrVal_4733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4733)))) is different from true [2022-11-19 08:21:24,692 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4734 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4734))) (exists ((v_ArrVal_4735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4735) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:24,709 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736))) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:24,726 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739))) (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:24,742 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:24,758 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4742))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4743) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:24,774 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744)))) is different from true [2022-11-19 08:21:24,790 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746)))) is different from true [2022-11-19 08:21:24,806 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748))) (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:24,822 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4750))) (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:21:24,838 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753)))) is different from true [2022-11-19 08:21:24,853 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4754) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4755) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:24,869 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757))) (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756)))) is different from true [2022-11-19 08:21:24,884 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:24,900 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4761 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4761) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4760)))) is different from true [2022-11-19 08:21:24,915 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763)))) is different from true [2022-11-19 08:21:24,930 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764)))) is different from true [2022-11-19 08:21:24,946 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766)))) is different from true [2022-11-19 08:21:24,960 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768)))) is different from true [2022-11-19 08:21:24,972 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770))) (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771)))) is different from true [2022-11-19 08:21:24,985 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:24,998 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:25,011 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776)))) is different from true [2022-11-19 08:21:25,031 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4779))) (exists ((v_ArrVal_4778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4778))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:21:25,083 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:21:25,084 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-19 08:21:25,091 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-19 08:21:25,207 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:21:25,207 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-19 08:21:25,218 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-19 08:21:25,258 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-19 08:21:25,263 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-19 08:21:25,274 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-19 08:21:25,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:21:25,354 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-19 08:21:25,394 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 08:21:26,466 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4873))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4872) .cse0 v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4872) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-19 08:21:26,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [150177693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:21:26,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004566618] [2022-11-19 08:21:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:26,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:21:26,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:21:26,479 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:21:26,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06637e60-761a-4786-9342-0fc702c805f2/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-19 08:21:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:27,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-19 08:21:27,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:27,424 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-19 08:21:27,442 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:21:27,442 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-19 08:21:27,455 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-19 08:21:27,469 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-19 08:21:27,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-19 08:21:27,558 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-19 08:21:27,662 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5239))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5240) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:27,713 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243))) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244)))) is different from true [2022-11-19 08:21:27,766 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247)))) is different from true [2022-11-19 08:21:27,819 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251)))) is different from true [2022-11-19 08:21:27,833 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254)))) is different from true [2022-11-19 08:21:27,848 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255)))) is different from true [2022-11-19 08:21:27,861 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5258) |c_#memory_$Pointer$.offset|)) (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-19 08:21:27,875 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:27,889 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5261) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5262) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:27,902 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5263) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264)))) is different from true [2022-11-19 08:21:27,916 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:27,930 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:27,946 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270))) (exists ((v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5269) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:27,960 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (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-19 08:21:27,975 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5273))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5274) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:27,990 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5275 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5275) |c_#memory_$Pointer$.offset|)) (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-19 08:21:28,022 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5278))) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:21:28,037 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280)))) is different from true [2022-11-19 08:21:28,052 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:28,068 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284))) (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-19 08:21:28,084 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5286))) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:28,100 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5287))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5288 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5288) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:28,114 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289))) (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:28,128 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291)))) is different from true [2022-11-19 08:21:28,144 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293)))) is different from true [2022-11-19 08:21:28,158 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5296))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295)))) is different from true [2022-11-19 08:21:28,175 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:28,191 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:28,206 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5301))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302)))) is different from true [2022-11-19 08:21:28,220 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303))) (exists ((v_ArrVal_5304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5304)))) is different from true [2022-11-19 08:21:28,235 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5305) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:28,249 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307)))) is different from true [2022-11-19 08:21:28,263 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310)))) is different from true [2022-11-19 08:21:28,277 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:21:28,291 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313))) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314)))) is different from true [2022-11-19 08:21:28,304 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-19 08:21:28,318 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-19 08:21:28,333 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320)))) is different from true [2022-11-19 08:21:28,355 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321)))) is different from true [2022-11-19 08:21:28,369 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324))) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:28,422 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:21:28,423 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-19 08:21:28,430 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-19 08:21:28,519 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:21:28,519 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-19 08:21:28,533 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-19 08:21:28,566 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-19 08:21:28,570 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-19 08:21:28,580 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-19 08:21:28,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:21:28,687 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-19 08:21:28,737 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-19 08:21:29,784 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5418) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5417))) (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~mem33#1.base| v_ArrVal_5418) .cse2 v_ArrVal_5325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-19 08:21:29,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004566618] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:21:29,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:21:29,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 52, 50] total 135 [2022-11-19 08:21:29,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694403255] [2022-11-19 08:21:29,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:21:29,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-11-19 08:21:29,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:21:29,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-11-19 08:21:29,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=255, Unknown=140, NotChecked=20770, Total=21462 [2022-11-19 08:21:29,798 INFO L87 Difference]: Start difference. First operand 1327 states and 1489 transitions. Second operand has 136 states, 134 states have (on average 1.6940298507462686) internal successors, (227), 136 states have internal predecessors, (227), 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-19 08:21:30,567 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4692 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4692))) (exists ((v_ArrVal_4146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4146))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4147 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4147) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4693 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4693))) (exists ((v_ArrVal_4158 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4158) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4159) |c_#memory_$Pointer$.base|))) is different from true [2022-11-19 08:21:30,592 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4697 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4697))) (exists ((v_ArrVal_5239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5239))) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150))) (exists ((v_ArrVal_4167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4167) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_5240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5240) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251))) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243))) (exists ((v_ArrVal_4158 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4158) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4159) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244))) (exists ((v_ArrVal_4166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4166))) (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151))) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696))) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164)))) is different from true [2022-11-19 08:21:30,600 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5239))) (exists ((v_ArrVal_4167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4167) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5248 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5248) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4698 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4698) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247))) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152))) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_5240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5240) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255))) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251))) (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243))) (exists ((v_ArrVal_4158 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4158) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4159) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5244))) (exists ((v_ArrVal_4166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4166))) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164)))) is different from true [2022-11-19 08:21:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:42,601 INFO L93 Difference]: Finished difference Result 1383 states and 1502 transitions. [2022-11-19 08:21:42,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 08:21:42,602 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 134 states have (on average 1.6940298507462686) internal successors, (227), 136 states have internal predecessors, (227), 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 113 [2022-11-19 08:21:42,602 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-11-19 08:21:42,603 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 134 states have (on average 1.6940298507462686) internal successors, (227), 136 states have internal predecessors, (227), 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 113