./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur --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 ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 --- 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-38b53e6 [2022-11-26 00:23:41,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:23:41,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:23:41,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:23:41,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:23:41,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:23:41,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:23:41,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:23:41,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:23:41,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:23:41,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:23:41,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:23:41,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:23:41,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:23:41,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:23:41,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:23:41,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:23:41,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:23:41,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:23:41,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:23:41,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:23:41,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:23:41,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:23:41,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:23:41,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:23:41,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:23:41,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:23:41,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:23:41,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:23:41,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:23:41,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:23:41,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:23:41,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:23:41,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:23:41,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:23:41,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:23:41,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:23:41,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:23:41,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:23:41,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:23:41,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:23:41,472 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-26 00:23:41,520 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:23:41,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:23:41,521 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:23:41,522 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:23:41,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:23:41,523 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:23:41,523 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:23:41,523 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:23:41,523 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:23:41,523 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:23:41,524 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:23:41,525 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:23:41,525 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:23:41,525 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:23:41,525 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:23:41,526 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:23:41,526 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:23:41,526 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:23:41,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 00:23:41,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 00:23:41,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:23:41,527 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:23:41,528 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:23:41,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:23:41,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:23:41,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:23:41,529 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 00:23:41,529 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 00:23:41,529 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-26 00:23:41,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:23:41,530 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:23:41,530 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:23:41,530 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:23:41,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:23:41,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:23:41,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:23:41,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:23:41,531 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:23:41,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:23:41,532 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:23:41,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:23:41,532 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:23:41,532 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_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/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_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur 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 -> ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 [2022-11-26 00:23:41,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:23:41,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:23:41,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:23:41,888 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:23:41,888 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:23:41,889 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2022-11-26 00:23:44,972 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:23:45,289 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:23:45,297 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2022-11-26 00:23:45,322 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/data/10aba9db1/56b70efb7d3c4ed8a52ccfd95a87f04c/FLAG038f3e7a4 [2022-11-26 00:23:45,342 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/data/10aba9db1/56b70efb7d3c4ed8a52ccfd95a87f04c [2022-11-26 00:23:45,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:23:45,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:23:45,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:23:45,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:23:45,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:23:45,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:23:45" (1/1) ... [2022-11-26 00:23:45,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6721c352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:45, skipping insertion in model container [2022-11-26 00:23:45,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:23:45" (1/1) ... [2022-11-26 00:23:45,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:23:45,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:23:46,097 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44118,44131] [2022-11-26 00:23:46,111 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44660,44673] [2022-11-26 00:23:46,114 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-26 00:23:46,254 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56247,56260] [2022-11-26 00:23:46,267 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56368,56381] [2022-11-26 00:23:46,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:23:46,286 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-26 00:23:46,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@660fa474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:46, skipping insertion in model container [2022-11-26 00:23:46,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:23:46,311 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-26 00:23:46,313 INFO L158 Benchmark]: Toolchain (without parser) took 964.77ms. Allocated memory is still 188.7MB. Free memory was 140.7MB in the beginning and 119.2MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-26 00:23:46,314 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 130.0MB. Free memory was 73.6MB in the beginning and 73.4MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:23:46,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 960.33ms. Allocated memory is still 188.7MB. Free memory was 140.7MB in the beginning and 119.2MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-26 00:23:46,316 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.30ms. Allocated memory is still 130.0MB. Free memory was 73.6MB in the beginning and 73.4MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 960.33ms. Allocated memory is still 188.7MB. Free memory was 140.7MB in the beginning and 119.2MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: 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_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur --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 ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 --- 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-38b53e6 [2022-11-26 00:23:48,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:23:48,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:23:48,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:23:48,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:23:48,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:23:48,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:23:48,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:23:48,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:23:48,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:23:48,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:23:48,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:23:48,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:23:48,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:23:48,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:23:48,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:23:48,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:23:48,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:23:48,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:23:48,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:23:48,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:23:48,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:23:48,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:23:48,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:23:48,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:23:48,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:23:48,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:23:48,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:23:48,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:23:48,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:23:48,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:23:48,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:23:48,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:23:48,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:23:48,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:23:48,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:23:48,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:23:48,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:23:48,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:23:48,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:23:48,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:23:48,724 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-26 00:23:48,748 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:23:48,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:23:48,748 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:23:48,749 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:23:48,749 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:23:48,750 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:23:48,750 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:23:48,750 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:23:48,751 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:23:48,751 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:23:48,751 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:23:48,751 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:23:48,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 00:23:48,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 00:23:48,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:23:48,753 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:23:48,753 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:23:48,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:23:48,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:23:48,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:23:48,754 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 00:23:48,754 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 00:23:48,754 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-26 00:23:48,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:23:48,755 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:23:48,755 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-26 00:23:48,756 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-26 00:23:48,756 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:23:48,756 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:23:48,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:23:48,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-26 00:23:48,757 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:23:48,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:23:48,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:23:48,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:23:48,758 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-26 00:23:48,758 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-26 00:23:48,758 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:23:48,759 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-26 00:23:48,759 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_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/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_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur 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 -> ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 [2022-11-26 00:23:49,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:23:49,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:23:49,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:23:49,217 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:23:49,218 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:23:49,220 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2022-11-26 00:23:52,503 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:23:52,896 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:23:52,897 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2022-11-26 00:23:52,915 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/data/43dbf38ae/84d15496035e42e487b96ffda4ad05c2/FLAG11ca58fb4 [2022-11-26 00:23:52,934 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/data/43dbf38ae/84d15496035e42e487b96ffda4ad05c2 [2022-11-26 00:23:52,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:23:52,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:23:52,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:23:52,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:23:52,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:23:52,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:23:52" (1/1) ... [2022-11-26 00:23:52,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a9f3ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:52, skipping insertion in model container [2022-11-26 00:23:52,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:23:52" (1/1) ... [2022-11-26 00:23:52,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:23:53,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:23:53,756 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44118,44131] [2022-11-26 00:23:53,779 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44660,44673] [2022-11-26 00:23:53,782 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-26 00:23:53,897 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56247,56260] [2022-11-26 00:23:53,898 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56368,56381] [2022-11-26 00:23:53,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:23:53,919 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-26 00:23:53,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:23:53,960 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44118,44131] [2022-11-26 00:23:53,964 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44660,44673] [2022-11-26 00:23:53,965 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-26 00:23:54,044 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56247,56260] [2022-11-26 00:23:54,059 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56368,56381] [2022-11-26 00:23:54,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:23:54,084 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:23:54,137 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44118,44131] [2022-11-26 00:23:54,152 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44660,44673] [2022-11-26 00:23:54,154 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-26 00:23:54,235 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56247,56260] [2022-11-26 00:23:54,236 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56368,56381] [2022-11-26 00:23:54,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:23:54,291 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:23:54,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:54 WrapperNode [2022-11-26 00:23:54,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:23:54,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:23:54,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:23:54,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:23:54,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:54" (1/1) ... [2022-11-26 00:23:54,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:54" (1/1) ... [2022-11-26 00:23:54,388 INFO L138 Inliner]: procedures = 285, calls = 294, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1038 [2022-11-26 00:23:54,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:23:54,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:23:54,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:23:54,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:23:54,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:54" (1/1) ... [2022-11-26 00:23:54,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:54" (1/1) ... [2022-11-26 00:23:54,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:54" (1/1) ... [2022-11-26 00:23:54,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:54" (1/1) ... [2022-11-26 00:23:54,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:54" (1/1) ... [2022-11-26 00:23:54,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:54" (1/1) ... [2022-11-26 00:23:54,506 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:54" (1/1) ... [2022-11-26 00:23:54,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:54" (1/1) ... [2022-11-26 00:23:54,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:23:54,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:23:54,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:23:54,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:23:54,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:54" (1/1) ... [2022-11-26 00:23:54,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:23:54,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:23:54,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:23:54,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:23:54,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-26 00:23:54,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-26 00:23:54,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:23:54,624 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-26 00:23:54,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 00:23:54,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:23:54,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-26 00:23:54,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-26 00:23:54,626 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2022-11-26 00:23:54,626 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2022-11-26 00:23:54,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-26 00:23:54,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-26 00:23:54,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:23:54,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:23:54,628 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2022-11-26 00:23:54,628 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2022-11-26 00:23:54,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 00:23:54,628 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2022-11-26 00:23:54,628 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2022-11-26 00:23:54,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:23:54,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:23:54,932 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:23:54,934 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:23:59,922 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:23:59,935 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:23:59,936 INFO L300 CfgBuilder]: Removed 63 assume(true) statements. [2022-11-26 00:23:59,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:23:59 BoogieIcfgContainer [2022-11-26 00:23:59,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:23:59,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:23:59,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:23:59,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:23:59,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:23:52" (1/3) ... [2022-11-26 00:23:59,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3971c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:23:59, skipping insertion in model container [2022-11-26 00:23:59,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:54" (2/3) ... [2022-11-26 00:23:59,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3971c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:23:59, skipping insertion in model container [2022-11-26 00:23:59,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:23:59" (3/3) ... [2022-11-26 00:23:59,949 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-1.i [2022-11-26 00:23:59,985 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:23:59,986 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 531 error locations. [2022-11-26 00:24:00,064 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:24:00,070 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;@46cbdef8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:24:00,071 INFO L358 AbstractCegarLoop]: Starting to check reachability of 531 error locations. [2022-11-26 00:24:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 1082 states, 533 states have (on average 2.2288930581613506) internal successors, (1188), 1064 states have internal predecessors, (1188), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-26 00:24:00,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:24:00,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:00,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:24:00,086 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:00,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:00,091 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2022-11-26 00:24:00,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:00,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779555381] [2022-11-26 00:24:00,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:00,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:24:00,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:00,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:00,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:00,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:24:00,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:00,347 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-26 00:24:00,361 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-26 00:24:00,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:00,362 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:00,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779555381] [2022-11-26 00:24:00,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779555381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:00,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:00,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:24:00,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509625924] [2022-11-26 00:24:00,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:00,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:24:00,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:00,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:24:00,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:24:00,413 INFO L87 Difference]: Start difference. First operand has 1082 states, 533 states have (on average 2.2288930581613506) internal successors, (1188), 1064 states have internal predecessors, (1188), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:02,906 INFO L93 Difference]: Finished difference Result 1161 states and 1227 transitions. [2022-11-26 00:24:02,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:24:02,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-26 00:24:02,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:02,938 INFO L225 Difference]: With dead ends: 1161 [2022-11-26 00:24:02,943 INFO L226 Difference]: Without dead ends: 1159 [2022-11-26 00:24:02,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:24:02,952 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 714 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:02,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1040 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-26 00:24:02,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-11-26 00:24:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1102. [2022-11-26 00:24:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 567 states have (on average 2.0846560846560847) internal successors, (1182), 1085 states have internal predecessors, (1182), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:24:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1208 transitions. [2022-11-26 00:24:03,073 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1208 transitions. Word has length 3 [2022-11-26 00:24:03,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:03,073 INFO L495 AbstractCegarLoop]: Abstraction has 1102 states and 1208 transitions. [2022-11-26 00:24:03,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1208 transitions. [2022-11-26 00:24:03,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:24:03,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:03,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:24:03,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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)] Ended with exit code 0 [2022-11-26 00:24:03,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:03,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:03,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:03,285 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2022-11-26 00:24:03,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:03,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269022185] [2022-11-26 00:24:03,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:03,297 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-26 00:24:03,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:03,299 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:03,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:03,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:24:03,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:03,458 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-26 00:24:03,479 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-26 00:24:03,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:03,480 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:03,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269022185] [2022-11-26 00:24:03,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269022185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:03,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:03,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:24:03,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665295116] [2022-11-26 00:24:03,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:03,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:24:03,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:03,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:24:03,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:24:03,484 INFO L87 Difference]: Start difference. First operand 1102 states and 1208 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:07,155 INFO L93 Difference]: Finished difference Result 1496 states and 1636 transitions. [2022-11-26 00:24:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:24:07,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-26 00:24:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:07,161 INFO L225 Difference]: With dead ends: 1496 [2022-11-26 00:24:07,162 INFO L226 Difference]: Without dead ends: 1496 [2022-11-26 00:24:07,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:24:07,163 INFO L413 NwaCegarLoop]: 941 mSDtfsCounter, 418 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:07,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1534 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-26 00:24:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2022-11-26 00:24:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1306. [2022-11-26 00:24:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 770 states have (on average 2.07012987012987) internal successors, (1594), 1287 states have internal predecessors, (1594), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-26 00:24:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1624 transitions. [2022-11-26 00:24:07,221 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1624 transitions. Word has length 3 [2022-11-26 00:24:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:07,221 INFO L495 AbstractCegarLoop]: Abstraction has 1306 states and 1624 transitions. [2022-11-26 00:24:07,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1624 transitions. [2022-11-26 00:24:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:24:07,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:07,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:07,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-26 00:24:07,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:07,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:07,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:07,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2022-11-26 00:24:07,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:07,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505657314] [2022-11-26 00:24:07,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:07,436 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-26 00:24:07,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:07,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:07,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:07,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:24:07,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:07,627 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-26 00:24:07,634 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-26 00:24:07,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:07,724 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-26 00:24:07,745 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:24:07,745 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-26 00:24:07,781 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-26 00:24:07,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:07,781 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:07,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505657314] [2022-11-26 00:24:07,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505657314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:07,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:07,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:24:07,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419208094] [2022-11-26 00:24:07,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:07,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:24:07,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:07,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:24:07,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:24:07,785 INFO L87 Difference]: Start difference. First operand 1306 states and 1624 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:13,708 INFO L93 Difference]: Finished difference Result 1996 states and 2369 transitions. [2022-11-26 00:24:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:24:13,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-26 00:24:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:13,716 INFO L225 Difference]: With dead ends: 1996 [2022-11-26 00:24:13,716 INFO L226 Difference]: Without dead ends: 1996 [2022-11-26 00:24:13,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-26 00:24:13,717 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 718 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:13,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1581 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-26 00:24:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2022-11-26 00:24:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1451. [2022-11-26 00:24:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 915 states have (on average 2.0513661202185793) internal successors, (1877), 1432 states have internal predecessors, (1877), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-26 00:24:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1907 transitions. [2022-11-26 00:24:13,753 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1907 transitions. Word has length 8 [2022-11-26 00:24:13,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:13,754 INFO L495 AbstractCegarLoop]: Abstraction has 1451 states and 1907 transitions. [2022-11-26 00:24:13,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:13,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1907 transitions. [2022-11-26 00:24:13,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:24:13,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:13,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:13,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:13,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:13,967 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:13,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2022-11-26 00:24:13,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:13,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013981546] [2022-11-26 00:24:13,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:13,969 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-26 00:24:13,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:13,970 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:13,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:14,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:24:14,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:14,133 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-26 00:24:14,160 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-26 00:24:14,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:14,164 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:14,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013981546] [2022-11-26 00:24:14,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013981546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:14,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:14,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:24:14,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586537050] [2022-11-26 00:24:14,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:14,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:24:14,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:14,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:24:14,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:24:14,169 INFO L87 Difference]: Start difference. First operand 1451 states and 1907 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-26 00:24:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:17,956 INFO L93 Difference]: Finished difference Result 2429 states and 3105 transitions. [2022-11-26 00:24:17,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:24:17,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-26 00:24:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:17,966 INFO L225 Difference]: With dead ends: 2429 [2022-11-26 00:24:17,966 INFO L226 Difference]: Without dead ends: 2429 [2022-11-26 00:24:17,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-26 00:24:17,967 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 2139 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:17,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 1969 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-26 00:24:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2022-11-26 00:24:17,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 1406. [2022-11-26 00:24:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 915 states have (on average 1.9868852459016393) internal successors, (1818), 1387 states have internal predecessors, (1818), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-26 00:24:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1848 transitions. [2022-11-26 00:24:18,006 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1848 transitions. Word has length 9 [2022-11-26 00:24:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:18,007 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 1848 transitions. [2022-11-26 00:24:18,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-26 00:24:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1848 transitions. [2022-11-26 00:24:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:24:18,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:18,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:18,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:18,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:18,225 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:18,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:18,225 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2022-11-26 00:24:18,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:18,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943320966] [2022-11-26 00:24:18,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:18,226 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-26 00:24:18,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:18,227 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:18,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:18,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:24:18,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:18,387 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-26 00:24:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:24:18,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:18,453 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:18,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943320966] [2022-11-26 00:24:18,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943320966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:18,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:18,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:24:18,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132468914] [2022-11-26 00:24:18,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:18,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:24:18,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:18,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:24:18,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:24:18,455 INFO L87 Difference]: Start difference. First operand 1406 states and 1848 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-26 00:24:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:22,919 INFO L93 Difference]: Finished difference Result 2045 states and 2683 transitions. [2022-11-26 00:24:22,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:24:22,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-26 00:24:22,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:22,927 INFO L225 Difference]: With dead ends: 2045 [2022-11-26 00:24:22,934 INFO L226 Difference]: Without dead ends: 2045 [2022-11-26 00:24:22,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-26 00:24:22,940 INFO L413 NwaCegarLoop]: 1191 mSDtfsCounter, 1375 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:22,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 2090 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-26 00:24:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2022-11-26 00:24:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1396. [2022-11-26 00:24:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 915 states have (on average 1.960655737704918) internal successors, (1794), 1377 states have internal predecessors, (1794), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-26 00:24:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1824 transitions. [2022-11-26 00:24:22,998 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1824 transitions. Word has length 9 [2022-11-26 00:24:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:23,000 INFO L495 AbstractCegarLoop]: Abstraction has 1396 states and 1824 transitions. [2022-11-26 00:24:23,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-26 00:24:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1824 transitions. [2022-11-26 00:24:23,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:24:23,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:23,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:23,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-11-26 00:24:23,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:23,213 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr516ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:23,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1033799265, now seen corresponding path program 1 times [2022-11-26 00:24:23,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:23,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120789745] [2022-11-26 00:24:23,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:23,214 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-26 00:24:23,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:23,216 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:23,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:23,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:24:23,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:23,469 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-26 00:24:23,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:23,469 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:23,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120789745] [2022-11-26 00:24:23,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120789745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:23,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:23,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:24:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038075977] [2022-11-26 00:24:23,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:23,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:24:23,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:23,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:24:23,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:24:23,471 INFO L87 Difference]: Start difference. First operand 1396 states and 1824 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-26 00:24:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:24,288 INFO L93 Difference]: Finished difference Result 1872 states and 2391 transitions. [2022-11-26 00:24:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:24:24,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-26 00:24:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:24,295 INFO L225 Difference]: With dead ends: 1872 [2022-11-26 00:24:24,295 INFO L226 Difference]: Without dead ends: 1872 [2022-11-26 00:24:24,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-26 00:24:24,296 INFO L413 NwaCegarLoop]: 1154 mSDtfsCounter, 546 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 3116 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:24,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 3116 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-26 00:24:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2022-11-26 00:24:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1647. [2022-11-26 00:24:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1166 states have (on average 1.9742710120068612) internal successors, (2302), 1628 states have internal predecessors, (2302), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-26 00:24:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2332 transitions. [2022-11-26 00:24:24,360 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2332 transitions. Word has length 11 [2022-11-26 00:24:24,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:24,361 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 2332 transitions. [2022-11-26 00:24:24,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-26 00:24:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2332 transitions. [2022-11-26 00:24:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:24:24,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:24,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:24,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:24,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:24,563 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:24,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:24,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1297880888, now seen corresponding path program 1 times [2022-11-26 00:24:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:24,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095159710] [2022-11-26 00:24:24,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:24,565 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-26 00:24:24,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:24,566 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:24,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:24,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:24:24,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:24,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:24,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:24,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:24,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-11-26 00:24:24,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:24:24,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-11-26 00:24:24,877 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-26 00:24:24,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:24,878 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:24,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095159710] [2022-11-26 00:24:24,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095159710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:24,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:24,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:24:24,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629998020] [2022-11-26 00:24:24,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:24,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:24:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:24,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:24:24,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:24:24,880 INFO L87 Difference]: Start difference. First operand 1647 states and 2332 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:26,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:26,770 INFO L93 Difference]: Finished difference Result 1653 states and 2035 transitions. [2022-11-26 00:24:26,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:24:26,772 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-26 00:24:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:26,775 INFO L225 Difference]: With dead ends: 1653 [2022-11-26 00:24:26,775 INFO L226 Difference]: Without dead ends: 1653 [2022-11-26 00:24:26,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:24:26,776 INFO L413 NwaCegarLoop]: 1038 mSDtfsCounter, 358 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:26,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 2971 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-26 00:24:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-11-26 00:24:26,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1289. [2022-11-26 00:24:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 810 states have (on average 1.9506172839506173) internal successors, (1580), 1272 states have internal predecessors, (1580), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:24:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1606 transitions. [2022-11-26 00:24:26,803 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1606 transitions. Word has length 14 [2022-11-26 00:24:26,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:26,804 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1606 transitions. [2022-11-26 00:24:26,804 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:26,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1606 transitions. [2022-11-26 00:24:26,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:24:26,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:26,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:26,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-26 00:24:27,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:27,018 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2022-11-26 00:24:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:27,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608087474] [2022-11-26 00:24:27,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:27,019 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-26 00:24:27,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:27,020 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:27,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:27,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 00:24:27,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:27,224 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-26 00:24:27,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:27,225 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:27,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608087474] [2022-11-26 00:24:27,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608087474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:27,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:27,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:24:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136068367] [2022-11-26 00:24:27,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:27,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:24:27,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:27,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:24:27,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:24:27,227 INFO L87 Difference]: Start difference. First operand 1289 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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-26 00:24:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:27,260 INFO L93 Difference]: Finished difference Result 1229 states and 1520 transitions. [2022-11-26 00:24:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:24:27,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-11-26 00:24:27,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:27,264 INFO L225 Difference]: With dead ends: 1229 [2022-11-26 00:24:27,265 INFO L226 Difference]: Without dead ends: 1229 [2022-11-26 00:24:27,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-26 00:24:27,266 INFO L413 NwaCegarLoop]: 1027 mSDtfsCounter, 957 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1094 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-26 00:24:27,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 1094 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:24:27,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2022-11-26 00:24:27,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2022-11-26 00:24:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 774 states have (on average 1.930232558139535) internal successors, (1494), 1212 states have internal predecessors, (1494), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:24:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1520 transitions. [2022-11-26 00:24:27,297 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1520 transitions. Word has length 19 [2022-11-26 00:24:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:27,297 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 1520 transitions. [2022-11-26 00:24:27,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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-26 00:24:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1520 transitions. [2022-11-26 00:24:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:24:27,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:27,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:27,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:27,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:27,518 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2022-11-26 00:24:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:27,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446293241] [2022-11-26 00:24:27,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:27,519 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-26 00:24:27,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:27,520 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:27,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:27,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:24:27,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:27,730 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-26 00:24:27,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:27,731 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:27,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446293241] [2022-11-26 00:24:27,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446293241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:27,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:27,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:24:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615128546] [2022-11-26 00:24:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:27,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:24:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:27,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:24:27,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:24:27,734 INFO L87 Difference]: Start difference. First operand 1229 states and 1520 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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-26 00:24:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:27,805 INFO L93 Difference]: Finished difference Result 1201 states and 1464 transitions. [2022-11-26 00:24:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:24:27,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-11-26 00:24:27,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:27,814 INFO L225 Difference]: With dead ends: 1201 [2022-11-26 00:24:27,815 INFO L226 Difference]: Without dead ends: 1201 [2022-11-26 00:24:27,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-26 00:24:27,817 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 938 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:27,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 2024 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:24:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-11-26 00:24:27,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1199. [2022-11-26 00:24:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 758 states have (on average 1.8944591029023747) internal successors, (1436), 1182 states have internal predecessors, (1436), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:24:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1462 transitions. [2022-11-26 00:24:27,838 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1462 transitions. Word has length 21 [2022-11-26 00:24:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:27,838 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1462 transitions. [2022-11-26 00:24:27,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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-26 00:24:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1462 transitions. [2022-11-26 00:24:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 00:24:27,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:27,839 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] [2022-11-26 00:24:27,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:28,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:28,052 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:28,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:28,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2022-11-26 00:24:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:28,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911844292] [2022-11-26 00:24:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:28,053 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-26 00:24:28,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:28,059 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:28,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:28,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:24:28,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:28,301 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-26 00:24:28,418 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-26 00:24:28,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:28,419 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:28,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911844292] [2022-11-26 00:24:28,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911844292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:28,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:28,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:24:28,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185474628] [2022-11-26 00:24:28,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:28,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:24:28,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:28,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:24:28,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:24:28,421 INFO L87 Difference]: Start difference. First operand 1199 states and 1462 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-26 00:24:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:32,668 INFO L93 Difference]: Finished difference Result 2183 states and 2663 transitions. [2022-11-26 00:24:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:24:32,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-11-26 00:24:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:32,675 INFO L225 Difference]: With dead ends: 2183 [2022-11-26 00:24:32,675 INFO L226 Difference]: Without dead ends: 2183 [2022-11-26 00:24:32,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:24:32,676 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 2036 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:32,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2039 Valid, 2017 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-26 00:24:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2022-11-26 00:24:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1195. [2022-11-26 00:24:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 758 states have (on average 1.883905013192612) internal successors, (1428), 1178 states have internal predecessors, (1428), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:24:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1454 transitions. [2022-11-26 00:24:32,700 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1454 transitions. Word has length 35 [2022-11-26 00:24:32,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:32,701 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1454 transitions. [2022-11-26 00:24:32,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-26 00:24:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1454 transitions. [2022-11-26 00:24:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 00:24:32,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:32,702 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] [2022-11-26 00:24:32,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:32,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:32,915 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:32,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:32,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2022-11-26 00:24:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:32,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814639261] [2022-11-26 00:24:32,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:32,917 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-26 00:24:32,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:32,918 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:32,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:33,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 00:24:33,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:33,174 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-26 00:24:33,433 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-26 00:24:33,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:33,433 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:33,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814639261] [2022-11-26 00:24:33,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814639261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:33,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:33,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:24:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096658722] [2022-11-26 00:24:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:33,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:24:33,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:33,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:24:33,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:24:33,435 INFO L87 Difference]: Start difference. First operand 1195 states and 1454 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-26 00:24:38,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:38,562 INFO L93 Difference]: Finished difference Result 1805 states and 2217 transitions. [2022-11-26 00:24:38,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:24:38,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-11-26 00:24:38,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:38,570 INFO L225 Difference]: With dead ends: 1805 [2022-11-26 00:24:38,570 INFO L226 Difference]: Without dead ends: 1805 [2022-11-26 00:24:38,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:24:38,571 INFO L413 NwaCegarLoop]: 1229 mSDtfsCounter, 1783 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:38,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 2579 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-26 00:24:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-11-26 00:24:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1191. [2022-11-26 00:24:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 758 states have (on average 1.8733509234828496) internal successors, (1420), 1174 states have internal predecessors, (1420), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:24:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1446 transitions. [2022-11-26 00:24:38,593 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1446 transitions. Word has length 35 [2022-11-26 00:24:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:38,593 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1446 transitions. [2022-11-26 00:24:38,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-26 00:24:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1446 transitions. [2022-11-26 00:24:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-26 00:24:38,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:38,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:38,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:38,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:38,808 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:38,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2063932984, now seen corresponding path program 1 times [2022-11-26 00:24:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:38,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401532377] [2022-11-26 00:24:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:38,809 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-26 00:24:38,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:38,810 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:38,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:39,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:24:39,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:39,127 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-26 00:24:39,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:39,128 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:39,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401532377] [2022-11-26 00:24:39,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401532377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:39,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:39,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:24:39,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549562140] [2022-11-26 00:24:39,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:39,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:24:39,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:39,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:24:39,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:24:39,130 INFO L87 Difference]: Start difference. First operand 1191 states and 1446 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:39,203 INFO L93 Difference]: Finished difference Result 1179 states and 1426 transitions. [2022-11-26 00:24:39,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:24:39,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-26 00:24:39,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:39,208 INFO L225 Difference]: With dead ends: 1179 [2022-11-26 00:24:39,208 INFO L226 Difference]: Without dead ends: 1179 [2022-11-26 00:24:39,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:24:39,209 INFO L413 NwaCegarLoop]: 976 mSDtfsCounter, 907 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:39,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 2002 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:24:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-11-26 00:24:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2022-11-26 00:24:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 746 states have (on average 1.876675603217158) internal successors, (1400), 1162 states have internal predecessors, (1400), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:24:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1426 transitions. [2022-11-26 00:24:39,228 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1426 transitions. Word has length 54 [2022-11-26 00:24:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:39,229 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1426 transitions. [2022-11-26 00:24:39,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:39,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1426 transitions. [2022-11-26 00:24:39,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-26 00:24:39,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:39,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:39,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:39,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:39,445 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:39,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash -203146628, now seen corresponding path program 1 times [2022-11-26 00:24:39,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:39,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631780174] [2022-11-26 00:24:39,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:39,446 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-26 00:24:39,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:39,447 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:39,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:39,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 00:24:39,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:39,951 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:24:39,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 24 [2022-11-26 00:24:40,025 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:24:40,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-26 00:24:40,502 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-26 00:24:40,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:40,502 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:40,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631780174] [2022-11-26 00:24:40,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631780174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:40,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:40,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:24:40,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964453092] [2022-11-26 00:24:40,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:40,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:24:40,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:40,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:24:40,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:24:40,504 INFO L87 Difference]: Start difference. First operand 1179 states and 1426 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:44,935 INFO L93 Difference]: Finished difference Result 2639 states and 3164 transitions. [2022-11-26 00:24:44,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:24:44,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-26 00:24:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:44,943 INFO L225 Difference]: With dead ends: 2639 [2022-11-26 00:24:44,943 INFO L226 Difference]: Without dead ends: 2639 [2022-11-26 00:24:44,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:24:44,944 INFO L413 NwaCegarLoop]: 881 mSDtfsCounter, 3028 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3028 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:44,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3028 Valid, 1820 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-26 00:24:44,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2022-11-26 00:24:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 1615. [2022-11-26 00:24:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1167 states have (on average 1.8723221936589547) internal successors, (2185), 1586 states have internal predecessors, (2185), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-26 00:24:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2235 transitions. [2022-11-26 00:24:44,977 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2235 transitions. Word has length 62 [2022-11-26 00:24:44,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:44,978 INFO L495 AbstractCegarLoop]: Abstraction has 1615 states and 2235 transitions. [2022-11-26 00:24:44,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2235 transitions. [2022-11-26 00:24:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-26 00:24:44,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:44,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:45,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:45,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:45,194 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:45,195 INFO L85 PathProgramCache]: Analyzing trace with hash -203146627, now seen corresponding path program 1 times [2022-11-26 00:24:45,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:45,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464369947] [2022-11-26 00:24:45,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:45,195 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-26 00:24:45,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:45,197 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:45,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:45,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-26 00:24:45,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:45,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:45,660 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-26 00:24:45,747 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:24:45,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-26 00:24:46,493 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-26 00:24:46,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:46,493 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:46,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464369947] [2022-11-26 00:24:46,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464369947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:46,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:46,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:24:46,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483169137] [2022-11-26 00:24:46,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:46,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:24:46,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:46,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:24:46,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:24:46,495 INFO L87 Difference]: Start difference. First operand 1615 states and 2235 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:51,176 INFO L93 Difference]: Finished difference Result 1621 states and 2242 transitions. [2022-11-26 00:24:51,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:24:51,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-26 00:24:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:51,182 INFO L225 Difference]: With dead ends: 1621 [2022-11-26 00:24:51,182 INFO L226 Difference]: Without dead ends: 1621 [2022-11-26 00:24:51,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:24:51,183 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 111 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:51,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2283 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-26 00:24:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-11-26 00:24:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1620. [2022-11-26 00:24:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1171 states have (on average 1.8693424423569598) internal successors, (2189), 1590 states have internal predecessors, (2189), 26 states have call successors, (26), 9 states have call predecessors, (26), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-26 00:24:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2241 transitions. [2022-11-26 00:24:51,209 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2241 transitions. Word has length 62 [2022-11-26 00:24:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:51,210 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 2241 transitions. [2022-11-26 00:24:51,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2241 transitions. [2022-11-26 00:24:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-26 00:24:51,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:51,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:51,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:51,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:51,427 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:51,428 INFO L85 PathProgramCache]: Analyzing trace with hash 389814229, now seen corresponding path program 1 times [2022-11-26 00:24:51,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:51,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430872053] [2022-11-26 00:24:51,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:51,429 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-26 00:24:51,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:51,430 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:51,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:51,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:24:51,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:51,855 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-26 00:24:51,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:51,855 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:51,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430872053] [2022-11-26 00:24:51,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430872053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:51,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:51,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:24:51,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279658603] [2022-11-26 00:24:51,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:51,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:24:51,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:51,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:24:51,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:24:51,858 INFO L87 Difference]: Start difference. First operand 1620 states and 2241 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:52,004 INFO L93 Difference]: Finished difference Result 1646 states and 2268 transitions. [2022-11-26 00:24:52,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:24:52,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-26 00:24:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:52,010 INFO L225 Difference]: With dead ends: 1646 [2022-11-26 00:24:52,010 INFO L226 Difference]: Without dead ends: 1646 [2022-11-26 00:24:52,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:24:52,011 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 19 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4855 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:52,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4855 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:24:52,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-11-26 00:24:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1644. [2022-11-26 00:24:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1189 states have (on average 1.8603868797308662) internal successors, (2212), 1610 states have internal predecessors, (2212), 28 states have call successors, (28), 13 states have call predecessors, (28), 11 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-26 00:24:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2268 transitions. [2022-11-26 00:24:52,051 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2268 transitions. Word has length 68 [2022-11-26 00:24:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:52,051 INFO L495 AbstractCegarLoop]: Abstraction has 1644 states and 2268 transitions. [2022-11-26 00:24:52,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:52,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2268 transitions. [2022-11-26 00:24:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-26 00:24:52,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:52,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:52,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:52,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:52,253 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:52,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash 341176989, now seen corresponding path program 1 times [2022-11-26 00:24:52,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:52,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907952125] [2022-11-26 00:24:52,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:52,254 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-26 00:24:52,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:52,255 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:52,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-26 00:24:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:52,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:24:52,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:52,775 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-26 00:24:52,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:52,775 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:52,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907952125] [2022-11-26 00:24:52,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907952125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:52,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:52,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:24:52,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365024814] [2022-11-26 00:24:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:52,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:24:52,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:52,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:24:52,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:24:52,777 INFO L87 Difference]: Start difference. First operand 1644 states and 2268 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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-26 00:24:53,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:53,031 INFO L93 Difference]: Finished difference Result 1656 states and 2282 transitions. [2022-11-26 00:24:53,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:24:53,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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 68 [2022-11-26 00:24:53,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:53,039 INFO L225 Difference]: With dead ends: 1656 [2022-11-26 00:24:53,039 INFO L226 Difference]: Without dead ends: 1656 [2022-11-26 00:24:53,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:24:53,040 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 20 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3777 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:53,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3777 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:24:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-11-26 00:24:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1647. [2022-11-26 00:24:53,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1191 states have (on average 1.858942065491184) internal successors, (2214), 1612 states have internal predecessors, (2214), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-26 00:24:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2271 transitions. [2022-11-26 00:24:53,068 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2271 transitions. Word has length 68 [2022-11-26 00:24:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:53,068 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 2271 transitions. [2022-11-26 00:24:53,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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-26 00:24:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2271 transitions. [2022-11-26 00:24:53,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-26 00:24:53,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:53,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:53,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-26 00:24:53,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:53,284 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:53,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash -233122725, now seen corresponding path program 1 times [2022-11-26 00:24:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:53,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887278011] [2022-11-26 00:24:53,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:53,285 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-26 00:24:53,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:53,287 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:53,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-26 00:24:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:53,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:24:53,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:53,763 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-26 00:24:53,946 WARN L859 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)))) is different from true [2022-11-26 00:24:53,966 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:24:53,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-26 00:24:53,980 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-26 00:24:53,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:24:53,981 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:24:53,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887278011] [2022-11-26 00:24:53,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887278011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:53,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:53,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:24:53,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376368616] [2022-11-26 00:24:53,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:53,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:24:53,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:24:53,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:24:53,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2022-11-26 00:24:53,983 INFO L87 Difference]: Start difference. First operand 1647 states and 2271 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:24:58,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:58,688 INFO L93 Difference]: Finished difference Result 2769 states and 3749 transitions. [2022-11-26 00:24:58,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:24:58,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2022-11-26 00:24:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:58,696 INFO L225 Difference]: With dead ends: 2769 [2022-11-26 00:24:58,696 INFO L226 Difference]: Without dead ends: 2769 [2022-11-26 00:24:58,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2022-11-26 00:24:58,697 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 1428 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 4034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1894 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:58,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 2219 Invalid, 4034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2121 Invalid, 0 Unknown, 1894 Unchecked, 4.6s Time] [2022-11-26 00:24:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2022-11-26 00:24:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1646. [2022-11-26 00:24:58,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1191 states have (on average 1.8572628043660788) internal successors, (2212), 1611 states have internal predecessors, (2212), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-26 00:24:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2269 transitions. [2022-11-26 00:24:58,743 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2269 transitions. Word has length 73 [2022-11-26 00:24:58,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:58,743 INFO L495 AbstractCegarLoop]: Abstraction has 1646 states and 2269 transitions. [2022-11-26 00:24:58,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:24:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2269 transitions. [2022-11-26 00:24:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-26 00:24:58,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:58,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:58,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-26 00:24:58,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:58,959 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:24:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash -233122724, now seen corresponding path program 1 times [2022-11-26 00:24:58,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:24:58,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970777775] [2022-11-26 00:24:58,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:58,960 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-26 00:24:58,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:24:58,961 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:58,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:24:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:59,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-26 00:24:59,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:59,410 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-26 00:24:59,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:24:59,995 WARN L859 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_1107 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |alt_malloc_#res.base| v_ArrVal_1107))) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2022-11-26 00:25:00,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:00,016 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-26 00:25:00,027 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:25:00,027 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-26 00:25:00,047 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-26 00:25:00,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:25:00,047 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:25:00,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970777775] [2022-11-26 00:25:00,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970777775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:25:00,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:25:00,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:25:00,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481181458] [2022-11-26 00:25:00,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:25:00,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:25:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:25:00,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:25:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2022-11-26 00:25:00,050 INFO L87 Difference]: Start difference. First operand 1646 states and 2269 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:25:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:25:07,711 INFO L93 Difference]: Finished difference Result 2840 states and 3874 transitions. [2022-11-26 00:25:07,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:25:07,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2022-11-26 00:25:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:25:07,726 INFO L225 Difference]: With dead ends: 2840 [2022-11-26 00:25:07,726 INFO L226 Difference]: Without dead ends: 2840 [2022-11-26 00:25:07,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2022-11-26 00:25:07,728 INFO L413 NwaCegarLoop]: 1040 mSDtfsCounter, 2151 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 3092 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2157 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 5020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1900 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:25:07,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2157 Valid, 2397 Invalid, 5020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3092 Invalid, 0 Unknown, 1900 Unchecked, 7.5s Time] [2022-11-26 00:25:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2022-11-26 00:25:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 1642. [2022-11-26 00:25:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1195 states have (on average 1.8410041841004183) internal successors, (2200), 1607 states have internal predecessors, (2200), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-26 00:25:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2257 transitions. [2022-11-26 00:25:07,789 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2257 transitions. Word has length 73 [2022-11-26 00:25:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:25:07,789 INFO L495 AbstractCegarLoop]: Abstraction has 1642 states and 2257 transitions. [2022-11-26 00:25:07,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:25:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2257 transitions. [2022-11-26 00:25:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-26 00:25:07,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:25:07,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:25:07,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:25:08,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:25:08,016 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:25:08,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:25:08,016 INFO L85 PathProgramCache]: Analyzing trace with hash -159183299, now seen corresponding path program 1 times [2022-11-26 00:25:08,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:25:08,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883277218] [2022-11-26 00:25:08,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:25:08,017 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-26 00:25:08,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:25:08,019 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:25:08,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-26 00:25:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:25:08,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-26 00:25:08,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:08,413 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-26 00:25:08,438 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-26 00:25:08,466 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-26 00:25:08,508 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-26 00:25:08,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:25:08,508 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:25:08,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883277218] [2022-11-26 00:25:08,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883277218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:25:08,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:25:08,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 00:25:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335040430] [2022-11-26 00:25:08,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:25:08,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 00:25:08,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:25:08,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 00:25:08,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:25:08,511 INFO L87 Difference]: Start difference. First operand 1642 states and 2257 transitions. Second operand has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:25:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:25:13,456 INFO L93 Difference]: Finished difference Result 1657 states and 2273 transitions. [2022-11-26 00:25:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:25:13,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2022-11-26 00:25:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:25:13,461 INFO L225 Difference]: With dead ends: 1657 [2022-11-26 00:25:13,461 INFO L226 Difference]: Without dead ends: 1657 [2022-11-26 00:25:13,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:25:13,462 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 23 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4068 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:25:13,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4068 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-26 00:25:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-11-26 00:25:13,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1656. [2022-11-26 00:25:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1207 states have (on average 1.835956917978459) internal successors, (2216), 1619 states have internal predecessors, (2216), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-26 00:25:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2273 transitions. [2022-11-26 00:25:13,490 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2273 transitions. Word has length 80 [2022-11-26 00:25:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:25:13,491 INFO L495 AbstractCegarLoop]: Abstraction has 1656 states and 2273 transitions. [2022-11-26 00:25:13,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:25:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2273 transitions. [2022-11-26 00:25:13,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-26 00:25:13,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:25:13,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:25:13,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-26 00:25:13,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:25:13,707 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:25:13,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:25:13,707 INFO L85 PathProgramCache]: Analyzing trace with hash -639714905, now seen corresponding path program 1 times [2022-11-26 00:25:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:25:13,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555802811] [2022-11-26 00:25:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:25:13,708 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-26 00:25:13,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:25:13,709 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:25:13,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-26 00:25:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:25:14,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-26 00:25:14,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:14,093 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-26 00:25:14,138 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-26 00:25:14,147 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-26 00:25:14,211 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-26 00:25:14,218 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-26 00:25:14,334 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-26 00:25:14,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:25:14,334 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:25:14,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555802811] [2022-11-26 00:25:14,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555802811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:25:14,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:25:14,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-26 00:25:14,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326083468] [2022-11-26 00:25:14,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:25:14,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 00:25:14,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:25:14,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 00:25:14,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-26 00:25:14,336 INFO L87 Difference]: Start difference. First operand 1656 states and 2273 transitions. Second operand has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:25:21,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:25:21,201 INFO L93 Difference]: Finished difference Result 1656 states and 2271 transitions. [2022-11-26 00:25:21,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:25:21,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2022-11-26 00:25:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:25:21,217 INFO L225 Difference]: With dead ends: 1656 [2022-11-26 00:25:21,217 INFO L226 Difference]: Without dead ends: 1656 [2022-11-26 00:25:21,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:25:21,219 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 19 mSDsluCounter, 3910 mSDsCounter, 0 mSdLazyCounter, 2866 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4864 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:25:21,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4864 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2866 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-11-26 00:25:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-11-26 00:25:21,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2022-11-26 00:25:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1207 states have (on average 1.8342999171499585) internal successors, (2214), 1619 states have internal predecessors, (2214), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-26 00:25:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2271 transitions. [2022-11-26 00:25:21,313 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2271 transitions. Word has length 81 [2022-11-26 00:25:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:25:21,314 INFO L495 AbstractCegarLoop]: Abstraction has 1656 states and 2271 transitions. [2022-11-26 00:25:21,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:25:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2271 transitions. [2022-11-26 00:25:21,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-26 00:25:21,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:25:21,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:25:21,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-11-26 00:25:21,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:25:21,524 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:25:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:25:21,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1094788593, now seen corresponding path program 1 times [2022-11-26 00:25:21,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:25:21,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345033413] [2022-11-26 00:25:21,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:25:21,525 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-26 00:25:21,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:25:21,526 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:25:21,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:25:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:25:21,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:25:21,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:21,922 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-26 00:25:21,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:25:21,923 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:25:21,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345033413] [2022-11-26 00:25:21,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345033413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:25:21,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:25:21,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:25:21,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931698690] [2022-11-26 00:25:21,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:25:21,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:25:21,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:25:21,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:25:21,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:25:21,925 INFO L87 Difference]: Start difference. First operand 1656 states and 2271 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:25:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:25:22,029 INFO L93 Difference]: Finished difference Result 1672 states and 2289 transitions. [2022-11-26 00:25:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:25:22,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 88 [2022-11-26 00:25:22,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:25:22,033 INFO L225 Difference]: With dead ends: 1672 [2022-11-26 00:25:22,033 INFO L226 Difference]: Without dead ends: 1666 [2022-11-26 00:25:22,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:25:22,034 INFO L413 NwaCegarLoop]: 962 mSDtfsCounter, 13 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:25:22,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2878 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:25:22,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2022-11-26 00:25:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2022-11-26 00:25:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1215 states have (on average 1.8304526748971193) internal successors, (2224), 1629 states have internal predecessors, (2224), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-26 00:25:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2283 transitions. [2022-11-26 00:25:22,057 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2283 transitions. Word has length 88 [2022-11-26 00:25:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:25:22,057 INFO L495 AbstractCegarLoop]: Abstraction has 1666 states and 2283 transitions. [2022-11-26 00:25:22,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:25:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2283 transitions. [2022-11-26 00:25:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-26 00:25:22,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:25:22,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:25:22,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:25:22,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:25:22,275 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:25:22,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:25:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1402763991, now seen corresponding path program 1 times [2022-11-26 00:25:22,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:25:22,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468626505] [2022-11-26 00:25:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:25:22,276 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-26 00:25:22,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:25:22,277 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:25:22,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-26 00:25:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:25:22,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:25:22,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:22,786 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-26 00:25:22,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:25:22,937 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-26 00:25:22,937 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:25:22,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468626505] [2022-11-26 00:25:22,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468626505] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:25:22,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1364730459] [2022-11-26 00:25:22,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:25:22,938 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:25:22,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:25:22,942 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:25:22,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-26 00:25:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:25:23,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:25:23,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:23,646 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-26 00:25:23,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:25:23,729 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-26 00:25:23,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1364730459] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:25:23,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83624342] [2022-11-26 00:25:23,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:25:23,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:25:23,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:25:23,734 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:25:23,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-26 00:25:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:25:24,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:25:24,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:24,144 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-26 00:25:24,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:25:24,340 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-26 00:25:24,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83624342] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:25:24,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 00:25:24,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2022-11-26 00:25:24,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084621717] [2022-11-26 00:25:24,341 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 00:25:24,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:25:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:25:24,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:25:24,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:25:24,342 INFO L87 Difference]: Start difference. First operand 1666 states and 2283 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-26 00:25:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:25:24,649 INFO L93 Difference]: Finished difference Result 1692 states and 2313 transitions. [2022-11-26 00:25:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 00:25:24,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 89 [2022-11-26 00:25:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:25:24,667 INFO L225 Difference]: With dead ends: 1692 [2022-11-26 00:25:24,667 INFO L226 Difference]: Without dead ends: 1680 [2022-11-26 00:25:24,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:25:24,668 INFO L413 NwaCegarLoop]: 965 mSDtfsCounter, 37 mSDsluCounter, 3839 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 4804 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:25:24,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 4804 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:25:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2022-11-26 00:25:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1674. [2022-11-26 00:25:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1223 states have (on average 1.8266557645134913) internal successors, (2234), 1637 states have internal predecessors, (2234), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-26 00:25:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2293 transitions. [2022-11-26 00:25:24,694 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2293 transitions. Word has length 89 [2022-11-26 00:25:24,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:25:24,694 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2293 transitions. [2022-11-26 00:25:24,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-26 00:25:24,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2293 transitions. [2022-11-26 00:25:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-26 00:25:24,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:25:24,695 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:25:24,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-11-26 00:25:24,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-26 00:25:25,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-26 00:25:25,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:25:25,318 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:25:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:25:25,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1478348943, now seen corresponding path program 2 times [2022-11-26 00:25:25,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:25:25,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893563109] [2022-11-26 00:25:25,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:25:25,319 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-26 00:25:25,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:25:25,320 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:25:25,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-26 00:25:25,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:25:25,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:25:25,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-26 00:25:25,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:26,098 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-26 00:25:26,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:25:26,528 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-26 00:25:26,528 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:25:26,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893563109] [2022-11-26 00:25:26,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893563109] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:25:26,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1421182223] [2022-11-26 00:25:26,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:25:26,529 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:25:26,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:25:26,531 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:25:26,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-26 00:25:28,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:25:28,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:25:28,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-26 00:25:28,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:28,805 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-26 00:25:28,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:25:28,940 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-26 00:25:28,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1421182223] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:25:28,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037388440] [2022-11-26 00:25:28,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:25:28,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:25:28,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:25:28,942 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:25:28,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-26 00:25:58,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:25:58,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:25:58,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-26 00:25:58,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:58,751 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:25:58,751 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-26 00:25:58,790 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-26 00:25:59,401 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:25:59,402 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-26 00:25:59,488 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-26 00:25:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:25:59,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:25:59,700 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-26 00:25:59,700 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-26 00:25:59,708 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2306) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2022-11-26 00:25:59,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037388440] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:25:59,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-26 00:25:59,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 14] total 29 [2022-11-26 00:25:59,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232024655] [2022-11-26 00:25:59,711 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-26 00:25:59,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-26 00:25:59,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:25:59,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-26 00:25:59,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=756, Unknown=3, NotChecked=56, Total=930 [2022-11-26 00:25:59,714 INFO L87 Difference]: Start difference. First operand 1674 states and 2293 transitions. Second operand has 29 states, 28 states have (on average 6.071428571428571) internal successors, (170), 27 states have internal predecessors, (170), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-26 00:26:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:20,561 INFO L93 Difference]: Finished difference Result 2193 states and 2951 transitions. [2022-11-26 00:26:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-26 00:26:20,562 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 6.071428571428571) internal successors, (170), 27 states have internal predecessors, (170), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 92 [2022-11-26 00:26:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:20,566 INFO L225 Difference]: With dead ends: 2193 [2022-11-26 00:26:20,566 INFO L226 Difference]: Without dead ends: 2181 [2022-11-26 00:26:20,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=645, Invalid=3478, Unknown=41, NotChecked=126, Total=4290 [2022-11-26 00:26:20,568 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 970 mSDsluCounter, 8441 mSDsCounter, 0 mSdLazyCounter, 9377 mSolverCounterSat, 52 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 8948 SdHoareTripleChecker+Invalid, 9445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 9377 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:20,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 8948 Invalid, 9445 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 9377 Invalid, 16 Unknown, 0 Unchecked, 18.6s Time] [2022-11-26 00:26:20,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2022-11-26 00:26:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 1691. [2022-11-26 00:26:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1241 states have (on average 1.8178887993553585) internal successors, (2256), 1654 states have internal predecessors, (2256), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-26 00:26:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2315 transitions. [2022-11-26 00:26:20,594 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2315 transitions. Word has length 92 [2022-11-26 00:26:20,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:20,594 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 2315 transitions. [2022-11-26 00:26:20,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 6.071428571428571) internal successors, (170), 27 states have internal predecessors, (170), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-26 00:26:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2315 transitions. [2022-11-26 00:26:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-26 00:26:20,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:20,596 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:20,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-26 00:26:20,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-26 00:26:21,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-11-26 00:26:21,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 00:26:21,209 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:26:21,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:21,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2075896398, now seen corresponding path program 1 times [2022-11-26 00:26:21,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:26:21,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453152821] [2022-11-26 00:26:21,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:21,211 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-26 00:26:21,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:26:21,211 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:26:21,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-26 00:26:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:21,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-26 00:26:21,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:21,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:23,018 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:26:23,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453152821] [2022-11-26 00:26:23,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453152821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:26:23,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2007237010] [2022-11-26 00:26:23,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:23,019 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:26:23,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:26:23,023 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:26:23,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-26 00:26:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:23,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-26 00:26:23,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:23,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:24,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2007237010] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:26:24,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223817536] [2022-11-26 00:26:24,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:24,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:24,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:24,243 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:26:24,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-26 00:26:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:24,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-26 00:26:24,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:24,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:26,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223817536] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:26:26,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 00:26:26,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15, 15] total 41 [2022-11-26 00:26:26,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108362879] [2022-11-26 00:26:26,738 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 00:26:26,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-26 00:26:26,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:26:26,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-26 00:26:26,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1187, Unknown=0, NotChecked=0, Total=1640 [2022-11-26 00:26:26,741 INFO L87 Difference]: Start difference. First operand 1691 states and 2315 transitions. Second operand has 41 states, 41 states have (on average 3.048780487804878) internal successors, (125), 41 states have internal predecessors, (125), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 00:26:31,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:31,465 INFO L93 Difference]: Finished difference Result 1799 states and 2453 transitions. [2022-11-26 00:26:31,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-26 00:26:31,466 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.048780487804878) internal successors, (125), 41 states have internal predecessors, (125), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 98 [2022-11-26 00:26:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:31,468 INFO L225 Difference]: With dead ends: 1799 [2022-11-26 00:26:31,469 INFO L226 Difference]: Without dead ends: 1781 [2022-11-26 00:26:31,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1810, Invalid=3890, Unknown=0, NotChecked=0, Total=5700 [2022-11-26 00:26:31,471 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 141 mSDsluCounter, 15552 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 16534 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:31,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 16534 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-26 00:26:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2022-11-26 00:26:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1727. [2022-11-26 00:26:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1277 states have (on average 1.802662490211433) internal successors, (2302), 1690 states have internal predecessors, (2302), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-26 00:26:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2361 transitions. [2022-11-26 00:26:31,512 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2361 transitions. Word has length 98 [2022-11-26 00:26:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:31,512 INFO L495 AbstractCegarLoop]: Abstraction has 1727 states and 2361 transitions. [2022-11-26 00:26:31,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.048780487804878) internal successors, (125), 41 states have internal predecessors, (125), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 00:26:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2361 transitions. [2022-11-26 00:26:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-26 00:26:31,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:31,514 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:31,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-11-26 00:26:31,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-26 00:26:31,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-26 00:26:32,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:26:32,122 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:26:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:32,123 INFO L85 PathProgramCache]: Analyzing trace with hash -493120974, now seen corresponding path program 2 times [2022-11-26 00:26:32,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:26:32,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923674304] [2022-11-26 00:26:32,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:26:32,124 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-26 00:26:32,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:26:32,124 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:26:32,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:26:32,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:26:32,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:26:32,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-26 00:26:33,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:33,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:40,123 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:26:40,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923674304] [2022-11-26 00:26:40,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923674304] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:26:40,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [249544408] [2022-11-26 00:26:40,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:26:40,123 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:26:40,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:26:40,124 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:26:40,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-26 00:26:42,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:26:42,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:26:42,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-26 00:26:42,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:43,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:45,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [249544408] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:26:45,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45625614] [2022-11-26 00:26:45,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 00:26:45,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:45,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:45,240 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:26:45,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-26 00:27:33,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 00:27:33,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:27:33,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-26 00:27:33,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:27:33,675 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-26 00:27:33,827 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:27:33,830 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-26 00:27:33,974 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-26 00:27:33,986 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-26 00:27:34,423 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-26 00:27:34,428 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-26 00:27:38,724 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:27:38,724 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-26 00:27:38,731 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-26 00:27:38,952 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-26 00:27:38,963 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-26 00:27:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-26 00:27:39,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:27:40,082 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3704 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3705 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-26 00:27:40,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45625614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:27:40,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-26 00:27:40,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27, 27, 13] total 64 [2022-11-26 00:27:40,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374280950] [2022-11-26 00:27:40,090 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-26 00:27:40,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-26 00:27:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:27:40,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-26 00:27:40,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=762, Invalid=3501, Unknown=31, NotChecked=128, Total=4422 [2022-11-26 00:27:40,093 INFO L87 Difference]: Start difference. First operand 1727 states and 2361 transitions. Second operand has 64 states, 63 states have (on average 3.2698412698412698) internal successors, (206), 61 states have internal predecessors, (206), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-26 00:29:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:29:34,644 INFO L93 Difference]: Finished difference Result 2402 states and 3249 transitions. [2022-11-26 00:29:34,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-26 00:29:34,645 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.2698412698412698) internal successors, (206), 61 states have internal predecessors, (206), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 110 [2022-11-26 00:29:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:29:34,649 INFO L225 Difference]: With dead ends: 2402 [2022-11-26 00:29:34,650 INFO L226 Difference]: Without dead ends: 2384 [2022-11-26 00:29:34,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 459 SyntacticMatches, 27 SemanticMatches, 148 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6414 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=3726, Invalid=18242, Unknown=88, NotChecked=294, Total=22350 [2022-11-26 00:29:34,655 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 1265 mSDsluCounter, 16074 mSDsCounter, 0 mSdLazyCounter, 23378 mSolverCounterSat, 81 mSolverCounterUnsat, 774 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 16592 SdHoareTripleChecker+Invalid, 24233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 23378 IncrementalHoareTripleChecker+Invalid, 774 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 81.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:29:34,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 16592 Invalid, 24233 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [81 Valid, 23378 Invalid, 774 Unknown, 0 Unchecked, 81.5s Time] [2022-11-26 00:29:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2022-11-26 00:29:34,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1798. [2022-11-26 00:29:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1349 states have (on average 1.776130467012602) internal successors, (2396), 1761 states have internal predecessors, (2396), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-26 00:29:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2455 transitions. [2022-11-26 00:29:34,695 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2455 transitions. Word has length 110 [2022-11-26 00:29:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:29:34,695 INFO L495 AbstractCegarLoop]: Abstraction has 1798 states and 2455 transitions. [2022-11-26 00:29:34,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.2698412698412698) internal successors, (206), 61 states have internal predecessors, (206), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-26 00:29:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2455 transitions. [2022-11-26 00:29:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-26 00:29:34,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:29:34,697 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:29:34,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-26 00:29:34,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-26 00:29:35,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-11-26 00:29:35,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 00:29:35,311 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:29:35,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:29:35,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1934250012, now seen corresponding path program 1 times [2022-11-26 00:29:35,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:29:35,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034350065] [2022-11-26 00:29:35,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:35,313 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-26 00:29:35,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:29:35,314 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:29:35,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-26 00:29:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:36,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-26 00:29:36,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:29:36,359 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-26 00:29:36,546 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:29:36,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-26 00:29:36,584 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-26 00:29:36,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 00:29:39,337 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:39,338 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-26 00:29:39,483 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:39,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-26 00:29:39,507 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-26 00:29:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:29:39,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:29:41,740 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-26 00:29:42,106 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4191))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4145)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:29:42,108 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:29:42,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034350065] [2022-11-26 00:29:42,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034350065] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:29:42,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [144867718] [2022-11-26 00:29:42,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:42,109 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:29:42,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:29:42,110 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:29:42,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-26 00:29:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:47,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-26 00:29:47,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:29:47,476 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-26 00:29:47,701 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:29:47,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-26 00:29:47,721 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-26 00:29:47,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 00:29:50,591 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:50,591 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-26 00:29:50,680 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:50,681 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-26 00:29:50,705 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-26 00:29:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:29:50,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:29:53,223 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4677))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4145)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:29:53,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [144867718] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:29:53,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110117982] [2022-11-26 00:29:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:53,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:29:53,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:29:53,227 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:29:53,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-26 00:29:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:53,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-26 00:29:53,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:29:54,165 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:29:54,165 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-26 00:29:54,209 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-26 00:29:57,183 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5114))) is different from true [2022-11-26 00:29:57,214 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:57,214 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 23 treesize of output 26 [2022-11-26 00:29:57,327 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:29:57,328 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-26 00:29:57,434 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-26 00:29:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-26 00:29:57,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:29:57,469 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-26 00:29:57,469 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-26 00:29:57,601 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-26 00:29:57,966 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5161)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-11-26 00:29:57,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110117982] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:29:57,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:29:57,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 25 [2022-11-26 00:29:57,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295166913] [2022-11-26 00:29:57,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:29:57,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-26 00:29:57,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:29:57,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-26 00:29:57,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=629, Unknown=52, NotChecked=342, Total=1122 [2022-11-26 00:29:57,971 INFO L87 Difference]: Start difference. First operand 1798 states and 2455 transitions. Second operand has 26 states, 23 states have (on average 5.0) internal successors, (115), 22 states have internal predecessors, (115), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-26 00:30:19,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:30:19,942 INFO L93 Difference]: Finished difference Result 2274 states and 3057 transitions. [2022-11-26 00:30:19,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:30:19,943 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.0) internal successors, (115), 22 states have internal predecessors, (115), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 135 [2022-11-26 00:30:19,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:30:19,947 INFO L225 Difference]: With dead ends: 2274 [2022-11-26 00:30:19,947 INFO L226 Difference]: Without dead ends: 2274 [2022-11-26 00:30:19,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 261 SyntacticMatches, 134 SemanticMatches, 46 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=215, Invalid=1463, Unknown=68, NotChecked=510, Total=2256 [2022-11-26 00:30:19,948 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 1701 mSDsluCounter, 6288 mSDsCounter, 0 mSdLazyCounter, 7364 mSolverCounterSat, 50 mSolverCounterUnsat, 969 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 6777 SdHoareTripleChecker+Invalid, 9783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 7364 IncrementalHoareTripleChecker+Invalid, 969 IncrementalHoareTripleChecker+Unknown, 1400 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:30:19,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 6777 Invalid, 9783 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 7364 Invalid, 969 Unknown, 1400 Unchecked, 20.9s Time] [2022-11-26 00:30:19,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2022-11-26 00:30:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1795. [2022-11-26 00:30:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1349 states have (on average 1.7716827279466272) internal successors, (2390), 1758 states have internal predecessors, (2390), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-26 00:30:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2449 transitions. [2022-11-26 00:30:19,989 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2449 transitions. Word has length 135 [2022-11-26 00:30:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:30:19,989 INFO L495 AbstractCegarLoop]: Abstraction has 1795 states and 2449 transitions. [2022-11-26 00:30:19,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.0) internal successors, (115), 22 states have internal predecessors, (115), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-26 00:30:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2449 transitions. [2022-11-26 00:30:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-26 00:30:19,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:30:19,991 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:30:20,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2022-11-26 00:30:20,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-11-26 00:30:20,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-26 00:30:20,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:30:20,615 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:30:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:30:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1934250013, now seen corresponding path program 1 times [2022-11-26 00:30:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:30:20,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155196363] [2022-11-26 00:30:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:30:20,616 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-26 00:30:20,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:30:20,618 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:30:20,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-11-26 00:30:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:30:21,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-26 00:30:21,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:30:21,788 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-26 00:30:22,181 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-26 00:30:22,235 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:30:22,236 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-26 00:30:22,287 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-26 00:30:22,296 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-26 00:30:22,479 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 18 treesize of output 10 [2022-11-26 00:30:22,484 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 7 treesize of output 3 [2022-11-26 00:30:25,070 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5646) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5645 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5645) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 00:30:25,135 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:30:25,135 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-26 00:30:25,146 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-26 00:30:25,306 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:30:25,306 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-26 00:30:25,316 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-26 00:30:25,346 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 25 treesize of output 13 [2022-11-26 00:30:25,353 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 15 treesize of output 7 [2022-11-26 00:30:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-26 00:30:25,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:30:25,621 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5648) |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~mem74#1.base| v_ArrVal_5647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-26 00:30:25,664 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_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-26 00:30:26,833 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5740))) (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~mem73#1.base| v_ArrVal_5739) .cse0 v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-26 00:30:26,842 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:30:26,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155196363] [2022-11-26 00:30:26,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155196363] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:30:26,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1453834955] [2022-11-26 00:30:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:30:26,843 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:30:26,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:30:26,844 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:30:26,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-11-26 00:30:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:30:31,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-26 00:30:31,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:30:31,781 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-26 00:30:31,788 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-26 00:30:32,560 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:30:32,560 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-26 00:30:32,575 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-26 00:30:32,665 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-26 00:30:32,673 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-26 00:30:32,805 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 20 treesize of output 8 [2022-11-26 00:30:32,953 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 7 treesize of output 3 [2022-11-26 00:30:37,617 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 16 treesize of output 18 [2022-11-26 00:30:37,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:30:37,880 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2022-11-26 00:30:37,902 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-26 00:30:37,903 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 60 treesize of output 44 [2022-11-26 00:30:38,072 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 15 [2022-11-26 00:30:38,086 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 26 treesize of output 14 [2022-11-26 00:30:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:30:38,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:30:38,779 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 231 treesize of output 159 [2022-11-26 00:30:47,202 WARN L233 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 63 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:30:47,706 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6232))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_6185 (_ BitVec 32))) (let ((.cse0 (select (select (store .cse1 v_arrayElimCell_72 (store (select .cse1 v_arrayElimCell_72) (bvadd (_ bv16 32) .cse2) v_ArrVal_6185)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (not (bvule (bvadd .cse2 (_ bv20 32)) (select |c_#length| v_arrayElimCell_72))))))) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6232))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse6 (select |c_#length| v_arrayElimCell_72))) (or (bvule (bvadd (_ bv8 32) (select (select (store .cse4 v_arrayElimCell_72 (store (select .cse4 v_arrayElimCell_72) (bvadd (_ bv16 32) .cse5) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse6) (not (bvule (bvadd .cse5 (_ bv20 32)) .cse6)))))))) is different from false [2022-11-26 00:30:47,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1453834955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:30:47,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379679133] [2022-11-26 00:30:47,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:30:47,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:30:47,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:30:47,724 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:30:47,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-26 00:30:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:30:48,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-26 00:30:48,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:30:48,880 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-26 00:30:48,914 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:30:48,915 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-26 00:30:49,061 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-26 00:30:49,072 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-26 00:30:49,461 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-26 00:30:49,466 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-26 00:30:52,478 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6716))) (exists ((v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6715) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-26 00:30:52,549 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:30:52,549 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-26 00:30:52,562 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-26 00:30:52,956 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:30:52,957 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-26 00:30:52,975 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-26 00:30:53,003 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-26 00:30:53,012 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-26 00:30:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-26 00:30:53,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:30:53,092 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6718) |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~mem74#1.base| v_ArrVal_6717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 00:30:53,133 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_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-26 00:30:54,246 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6809))) (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~mem73#1.base| v_ArrVal_6810) .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6810) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-26 00:30:54,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379679133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:30:54,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:30:54,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 36 [2022-11-26 00:30:54,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366184487] [2022-11-26 00:30:54,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:30:54,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-26 00:30:54,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:30:54,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-26 00:30:54,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1337, Unknown=45, NotChecked=738, Total=2256 [2022-11-26 00:30:54,256 INFO L87 Difference]: Start difference. First operand 1795 states and 2449 transitions. Second operand has 37 states, 33 states have (on average 7.212121212121212) internal successors, (238), 31 states have internal predecessors, (238), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-26 00:31:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:31:57,483 INFO L93 Difference]: Finished difference Result 2948 states and 3957 transitions. [2022-11-26 00:31:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 00:31:57,484 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 7.212121212121212) internal successors, (238), 31 states have internal predecessors, (238), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 135 [2022-11-26 00:31:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:31:57,487 INFO L225 Difference]: With dead ends: 2948 [2022-11-26 00:31:57,487 INFO L226 Difference]: Without dead ends: 2948 [2022-11-26 00:31:57,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 249 SyntacticMatches, 131 SemanticMatches, 61 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=278, Invalid=2558, Unknown=62, NotChecked=1008, Total=3906 [2022-11-26 00:31:57,489 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 3191 mSDsluCounter, 9880 mSDsCounter, 0 mSdLazyCounter, 21698 mSolverCounterSat, 54 mSolverCounterUnsat, 870 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3196 SdHoareTripleChecker+Valid, 10533 SdHoareTripleChecker+Invalid, 24606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 21698 IncrementalHoareTripleChecker+Invalid, 870 IncrementalHoareTripleChecker+Unknown, 1984 IncrementalHoareTripleChecker+Unchecked, 60.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:31:57,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3196 Valid, 10533 Invalid, 24606 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [54 Valid, 21698 Invalid, 870 Unknown, 1984 Unchecked, 60.9s Time] [2022-11-26 00:31:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2022-11-26 00:31:57,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 2096. [2022-11-26 00:31:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 1644 states have (on average 1.7919708029197081) internal successors, (2946), 2054 states have internal predecessors, (2946), 33 states have call successors, (33), 18 states have call predecessors, (33), 18 states have return successors, (36), 26 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-26 00:31:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3015 transitions. [2022-11-26 00:31:57,520 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3015 transitions. Word has length 135 [2022-11-26 00:31:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:31:57,521 INFO L495 AbstractCegarLoop]: Abstraction has 2096 states and 3015 transitions. [2022-11-26 00:31:57,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 7.212121212121212) internal successors, (238), 31 states have internal predecessors, (238), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-26 00:31:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3015 transitions. [2022-11-26 00:31:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-26 00:31:57,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:31:57,523 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:31:57,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-11-26 00:31:57,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-11-26 00:31:57,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-11-26 00:31:58,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 00:31:58,143 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:31:58,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:31:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1961199032, now seen corresponding path program 1 times [2022-11-26 00:31:58,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:31:58,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439797184] [2022-11-26 00:31:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:31:58,144 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-26 00:31:58,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:31:58,145 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:31:58,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-11-26 00:31:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:31:59,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-26 00:31:59,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:31:59,357 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-26 00:31:59,621 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:31:59,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-26 00:31:59,680 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-26 00:31:59,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 00:32:02,971 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:02,971 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-26 00:32:03,140 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:03,140 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-26 00:32:03,280 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:03,281 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-26 00:32:03,313 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-26 00:32:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:32:03,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:32:03,489 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7266) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2022-11-26 00:32:03,503 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-26 00:32:03,524 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7265))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7266)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:32:03,541 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7265))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7266)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:32:03,943 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7312))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7265)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7266)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:32:03,947 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:32:03,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439797184] [2022-11-26 00:32:03,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439797184] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:32:03,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1345120693] [2022-11-26 00:32:03,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:03,947 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:32:03,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:32:03,948 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:32:03,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-11-26 00:32:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:13,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-26 00:32:13,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:32:13,855 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-26 00:32:14,066 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:32:14,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-26 00:32:14,098 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-26 00:32:14,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 00:32:17,226 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:17,226 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-26 00:32:17,337 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:17,338 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-26 00:32:17,405 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:17,406 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-26 00:32:17,433 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-26 00:32:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:32:17,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:32:19,573 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7768) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-26 00:32:19,595 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7767))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7768)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:32:19,612 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7767))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7768)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:32:20,047 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7814))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7767)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7768)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:32:20,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1345120693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:32:20,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602971555] [2022-11-26 00:32:20,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:20,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:32:20,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:32:20,055 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:32:20,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-26 00:32:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:20,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-26 00:32:20,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:32:21,230 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:32:21,231 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-26 00:32:21,285 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-26 00:32:25,242 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:25,242 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-26 00:32:25,469 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:25,470 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-26 00:32:25,615 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:32:25,616 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-26 00:32:25,636 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-26 00:32:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:32:25,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:32:25,665 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8268) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:32:25,919 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8267))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:32:25,935 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8267))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-26 00:32:26,379 INFO L321 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2022-11-26 00:32:26,379 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 61 treesize of output 60 [2022-11-26 00:32:26,394 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8314 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8314))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8267)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2022-11-26 00:32:26,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602971555] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:32:26,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:32:26,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 28 [2022-11-26 00:32:26,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641145243] [2022-11-26 00:32:26,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:32:26,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-26 00:32:26,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:32:26,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-26 00:32:26,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=856, Unknown=47, NotChecked=936, Total=1980 [2022-11-26 00:32:26,401 INFO L87 Difference]: Start difference. First operand 2096 states and 3015 transitions. Second operand has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-26 00:32:54,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:54,157 INFO L93 Difference]: Finished difference Result 2574 states and 3621 transitions. [2022-11-26 00:32:54,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:32:54,158 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 138 [2022-11-26 00:32:54,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:54,160 INFO L225 Difference]: With dead ends: 2574 [2022-11-26 00:32:54,160 INFO L226 Difference]: Without dead ends: 2574 [2022-11-26 00:32:54,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 269 SyntacticMatches, 131 SemanticMatches, 60 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=297, Invalid=2036, Unknown=71, NotChecked=1378, Total=3782 [2022-11-26 00:32:54,161 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 1700 mSDsluCounter, 6945 mSDsCounter, 0 mSdLazyCounter, 8324 mSolverCounterSat, 51 mSolverCounterUnsat, 851 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 7433 SdHoareTripleChecker+Invalid, 9226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 8324 IncrementalHoareTripleChecker+Invalid, 851 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:54,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 7433 Invalid, 9226 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [51 Valid, 8324 Invalid, 851 Unknown, 0 Unchecked, 26.4s Time] [2022-11-26 00:32:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2022-11-26 00:32:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2095. [2022-11-26 00:32:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2095 states, 1644 states have (on average 1.7907542579075426) internal successors, (2944), 2053 states have internal predecessors, (2944), 33 states have call successors, (33), 18 states have call predecessors, (33), 18 states have return successors, (36), 26 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-26 00:32:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 3013 transitions. [2022-11-26 00:32:54,194 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 3013 transitions. Word has length 138 [2022-11-26 00:32:54,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:54,195 INFO L495 AbstractCegarLoop]: Abstraction has 2095 states and 3013 transitions. [2022-11-26 00:32:54,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-26 00:32:54,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 3013 transitions. [2022-11-26 00:32:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-26 00:32:54,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:54,197 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:32:54,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2022-11-26 00:32:54,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-26 00:32:54,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-11-26 00:32:54,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:32:54,822 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:32:54,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1961199033, now seen corresponding path program 1 times [2022-11-26 00:32:54,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:32:54,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542779689] [2022-11-26 00:32:54,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:54,823 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-26 00:32:54,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:32:54,829 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:32:54,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-11-26 00:32:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:56,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-26 00:32:56,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:32:56,280 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-26 00:32:56,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:32:56,790 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:32:56,790 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-26 00:32:56,842 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-26 00:32:56,851 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-26 00:32:57,047 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 18 treesize of output 10 [2022-11-26 00:32:57,052 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 7 treesize of output 3 [2022-11-26 00:33:00,054 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:33:00,054 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-26 00:33:00,071 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-26 00:33:00,257 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:33:00,257 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-26 00:33:00,270 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-26 00:33:00,436 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:33:00,437 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-26 00:33:00,444 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-26 00:33:00,492 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 15 treesize of output 7 [2022-11-26 00:33:00,496 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 25 treesize of output 13 [2022-11-26 00:33:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:33:00,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:00,911 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 00:33:00,962 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_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-26 00:33:01,042 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8816))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8815) .cse0 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8815) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-26 00:33:01,100 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8816))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8815) .cse1 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8815) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-26 00:33:02,267 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8909 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8909))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8816))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8910) .cse0 v_ArrVal_8815) .cse1 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8909 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8909))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8910) .cse6 v_ArrVal_8815) (select (select (store .cse7 .cse6 v_ArrVal_8816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8818))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-26 00:33:02,281 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:33:02,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542779689] [2022-11-26 00:33:02,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542779689] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:02,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [913921918] [2022-11-26 00:33:02,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:02,282 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:33:02,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:33:02,283 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:33:02,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-11-26 00:33:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:08,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 125 conjunts are in the unsatisfiable core [2022-11-26 00:33:08,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:08,254 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-26 00:33:08,568 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-26 00:33:08,601 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:33:08,602 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-26 00:33:08,683 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-26 00:33:08,693 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-26 00:33:08,948 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-26 00:33:08,954 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-26 00:33:11,946 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:33:11,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-26 00:33:11,962 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-26 00:33:12,205 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:33:12,206 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-26 00:33:12,212 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-26 00:33:12,377 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:33:12,377 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-26 00:33:12,387 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-26 00:33:12,418 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-26 00:33:12,422 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-26 00:33:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:33:12,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:12,503 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 00:33:12,537 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_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-26 00:33:12,628 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9411))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9412) .cse0 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9412) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-26 00:33:15,213 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9505))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9506) .cse1 v_ArrVal_9412) (select (select (store .cse2 .cse1 v_ArrVal_9411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9413))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9505))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9411))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9506) .cse4 v_ArrVal_9412) .cse5 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-26 00:33:15,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [913921918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:15,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890144075] [2022-11-26 00:33:15,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:15,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:15,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:15,227 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:15,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-26 00:33:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:16,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-26 00:33:16,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:16,455 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-26 00:33:16,498 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:33:16,498 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-26 00:33:16,514 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-26 00:33:16,526 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-26 00:33:16,630 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-26 00:33:16,636 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-26 00:33:20,398 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:33:20,398 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-26 00:33:20,422 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-26 00:33:20,595 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:33:20,595 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-26 00:33:20,603 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-26 00:33:20,694 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:33:20,694 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-26 00:33:20,707 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-26 00:33:20,745 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-26 00:33:20,750 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-26 00:33:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:33:20,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:20,849 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 00:33:20,896 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_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-26 00:33:21,045 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10006))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10007) .cse0 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10007) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-26 00:33:21,187 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_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10007) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10006))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10007) .cse3 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-26 00:33:23,439 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10100))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10101) .cse1 v_ArrVal_10007) (select (select (store .cse2 .cse1 v_ArrVal_10006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10009))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10100))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10006))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10101) .cse4 v_ArrVal_10007) .cse5 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-26 00:33:23,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890144075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:23,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:23,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 23 [2022-11-26 00:33:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661606719] [2022-11-26 00:33:23,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:23,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-26 00:33:23,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:33:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-26 00:33:23,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=594, Unknown=49, NotChecked=882, Total=1640 [2022-11-26 00:33:23,455 INFO L87 Difference]: Start difference. First operand 2095 states and 3013 transitions. Second operand has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 20 states have internal predecessors, (164), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-26 00:34:21,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:21,038 INFO L93 Difference]: Finished difference Result 2922 states and 3931 transitions. [2022-11-26 00:34:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:34:21,039 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 20 states have internal predecessors, (164), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 138 [2022-11-26 00:34:21,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:21,043 INFO L225 Difference]: With dead ends: 2922 [2022-11-26 00:34:21,044 INFO L226 Difference]: Without dead ends: 2922 [2022-11-26 00:34:21,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 268 SyntacticMatches, 135 SemanticMatches, 51 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=212, Invalid=1262, Unknown=64, NotChecked=1218, Total=2756 [2022-11-26 00:34:21,045 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 1917 mSDsluCounter, 7753 mSDsCounter, 0 mSdLazyCounter, 14310 mSolverCounterSat, 28 mSolverCounterUnsat, 603 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 8542 SdHoareTripleChecker+Invalid, 14941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 14310 IncrementalHoareTripleChecker+Invalid, 603 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:21,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1922 Valid, 8542 Invalid, 14941 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [28 Valid, 14310 Invalid, 603 Unknown, 0 Unchecked, 54.9s Time] [2022-11-26 00:34:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-11-26 00:34:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2094. [2022-11-26 00:34:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2094 states, 1644 states have (on average 1.789537712895377) internal successors, (2942), 2052 states have internal predecessors, (2942), 33 states have call successors, (33), 18 states have call predecessors, (33), 18 states have return successors, (36), 26 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-26 00:34:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3011 transitions. [2022-11-26 00:34:21,077 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3011 transitions. Word has length 138 [2022-11-26 00:34:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:21,077 INFO L495 AbstractCegarLoop]: Abstraction has 2094 states and 3011 transitions. [2022-11-26 00:34:21,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 20 states have internal predecessors, (164), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-26 00:34:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3011 transitions. [2022-11-26 00:34:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-26 00:34:21,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:21,088 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:21,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-11-26 00:34:21,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2022-11-26 00:34:21,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2022-11-26 00:34:21,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:34:21,703 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:34:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:21,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1640576451, now seen corresponding path program 1 times [2022-11-26 00:34:21,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:34:21,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867968984] [2022-11-26 00:34:21,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:21,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:34:21,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:34:21,705 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:34:21,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-11-26 00:34:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:23,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-26 00:34:23,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:23,134 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-26 00:34:23,581 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:34:23,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-26 00:34:23,652 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-26 00:34:23,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 00:34:28,170 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:34:28,171 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-26 00:34:28,412 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:34:28,412 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-26 00:34:28,625 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:34:28,626 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-26 00:34:28,847 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:34:28,847 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-26 00:34:28,886 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-26 00:34:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:34:28,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:34:31,697 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10572))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:34:31,721 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:34:31,756 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10571))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:34:31,784 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10571))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:34:32,339 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10619))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10571)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-26 00:34:32,346 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:34:32,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867968984] [2022-11-26 00:34:32,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867968984] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:32,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [122596386] [2022-11-26 00:34:32,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:32,346 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:34:32,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:34:32,347 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:34:32,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-26 00:34:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:40,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-26 00:34:40,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:40,207 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-26 00:34:40,604 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:34:40,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-26 00:34:40,638 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-26 00:34:40,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-26 00:34:45,083 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:34:45,083 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-26 00:34:45,226 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:34:45,226 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-26 00:34:45,337 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:34:45,337 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-26 00:34:45,458 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:34:45,459 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-26 00:34:45,497 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-26 00:34:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-26 00:34:45,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:34:45,551 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_11091) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:34:45,572 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_11091) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-26 00:34:45,828 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-26 00:34:46,119 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11089))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11090)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-26 00:34:46,686 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11137))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11089)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11090)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-26 00:34:46,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [122596386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:46,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254570698] [2022-11-26 00:34:46,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:46,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:46,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:34:46,694 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:34:46,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-26 00:34:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:47,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-26 00:34:47,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:48,180 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:34:48,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-26 00:34:48,277 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-26 00:34:54,252 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_11604 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_11604))) is different from true [2022-11-26 00:34:54,302 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:34:54,303 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 23 treesize of output 26 [2022-11-26 00:34:54,502 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:34:54,502 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 23 treesize of output 26 [2022-11-26 00:34:54,709 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:34:54,709 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 23 treesize of output 26 [2022-11-26 00:34:54,913 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:34:54,913 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-26 00:34:57,129 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-26 00:34:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-26 00:34:57,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:34:57,182 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-26 00:34:57,182 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-26 00:34:57,195 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem76#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-11-26 00:34:57,211 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-26 00:34:57,235 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_11606)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-11-26 00:34:57,254 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-26 00:34:57,284 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11605 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_11605))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-26 00:34:57,306 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11605 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11605))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2022-11-26 00:34:57,847 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11605 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11653))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11605)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-26 00:34:57,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254570698] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:57,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:34:57,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 29 [2022-11-26 00:34:57,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163146794] [2022-11-26 00:34:57,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:34:57,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-26 00:34:57,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:34:57,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-26 00:34:57,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=968, Unknown=70, NotChecked=1458, Total=2652 [2022-11-26 00:34:57,855 INFO L87 Difference]: Start difference. First operand 2094 states and 3011 transitions. Second operand has 30 states, 27 states have (on average 4.703703703703703) internal successors, (127), 26 states have internal predecessors, (127), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-26 00:35:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:41,300 INFO L93 Difference]: Finished difference Result 2572 states and 3617 transitions. [2022-11-26 00:35:41,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:35:41,300 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 4.703703703703703) internal successors, (127), 26 states have internal predecessors, (127), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 141 [2022-11-26 00:35:41,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:41,304 INFO L225 Difference]: With dead ends: 2572 [2022-11-26 00:35:41,304 INFO L226 Difference]: Without dead ends: 2572 [2022-11-26 00:35:41,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 280 SyntacticMatches, 133 SemanticMatches, 66 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 2095 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=304, Invalid=2130, Unknown=88, NotChecked=2034, Total=4556 [2022-11-26 00:35:41,305 INFO L413 NwaCegarLoop]: 487 mSDtfsCounter, 1688 mSDsluCounter, 8050 mSDsCounter, 0 mSdLazyCounter, 9307 mSolverCounterSat, 53 mSolverCounterUnsat, 899 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 8537 SdHoareTripleChecker+Invalid, 11648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 9307 IncrementalHoareTripleChecker+Invalid, 899 IncrementalHoareTripleChecker+Unknown, 1389 IncrementalHoareTripleChecker+Unchecked, 41.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:35:41,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 8537 Invalid, 11648 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 9307 Invalid, 899 Unknown, 1389 Unchecked, 41.4s Time] [2022-11-26 00:35:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2022-11-26 00:35:41,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2093. [2022-11-26 00:35:41,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1644 states have (on average 1.7883211678832116) internal successors, (2940), 2051 states have internal predecessors, (2940), 33 states have call successors, (33), 18 states have call predecessors, (33), 18 states have return successors, (36), 26 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-26 00:35:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 3009 transitions. [2022-11-26 00:35:41,346 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 3009 transitions. Word has length 141 [2022-11-26 00:35:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:41,346 INFO L495 AbstractCegarLoop]: Abstraction has 2093 states and 3009 transitions. [2022-11-26 00:35:41,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 4.703703703703703) internal successors, (127), 26 states have internal predecessors, (127), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-26 00:35:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 3009 transitions. [2022-11-26 00:35:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-26 00:35:41,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:41,348 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:41,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2022-11-26 00:35:41,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-26 00:35:41,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2022-11-26 00:35:41,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 00:35:41,971 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-26 00:35:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:41,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1640576452, now seen corresponding path program 1 times [2022-11-26 00:35:41,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:35:41,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097632378] [2022-11-26 00:35:41,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:41,973 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-26 00:35:41,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:35:41,974 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -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-26 00:35:42,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-11-26 00:35:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:43,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 129 conjunts are in the unsatisfiable core [2022-11-26 00:35:43,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:35:43,705 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-26 00:35:44,443 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-26 00:35:44,542 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-26 00:35:44,542 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-26 00:35:44,629 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-26 00:35:44,647 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-26 00:35:44,934 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 18 treesize of output 10 [2022-11-26 00:35:44,942 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 7 treesize of output 3 [2022-11-26 00:35:49,326 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_168 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_168) (_ bv44 32))) (exists ((v_ArrVal_12168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_12168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_12167 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_12167)))) is different from true [2022-11-26 00:35:49,414 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:49,414 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-26 00:35:49,423 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-26 00:35:49,710 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:49,710 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-26 00:35:49,729 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-26 00:35:49,961 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:49,962 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-26 00:35:49,983 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-26 00:35:50,215 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:35:50,216 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-26 00:35:50,238 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-26 00:35:50,280 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 15 treesize of output 7 [2022-11-26 00:35:50,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 25 treesize of output 13 [2022-11-26 00:35:50,380 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-26 00:35:50,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:35:50,738 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-26 00:35:50,785 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_12174 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-26 00:35:50,913 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12172) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12171))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12172) .cse2 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-26 00:35:50,982 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12171))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12172) .cse1 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12172) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2022-11-26 00:35:52,060 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12170))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12169) .cse1 v_ArrVal_12172) (select (select (store .cse2 .cse1 v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12174))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12170))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_12171))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12169) .cse4 v_ArrVal_12172) .cse5 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-26 00:35:52,959 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (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|) .cse3))) (and (forall ((v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12170))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12171))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12169) .cse1 v_ArrVal_12172) .cse2 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12170))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12169) .cse7 v_ArrVal_12172) (select (select (store .cse8 .cse7 v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12174))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2022-11-26 00:35:56,676 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12266))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_12170))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12265) .cse1 v_ArrVal_12169) .cse2 v_ArrVal_12172) (select (select (store .cse3 .cse2 v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12174))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12266))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_12170))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_12171))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12265) .cse6 v_ArrVal_12169) .cse7 v_ArrVal_12172) .cse8 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2022-11-26 00:35:56,708 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:35:56,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097632378] [2022-11-26 00:35:56,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097632378] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:35:56,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [945390691] [2022-11-26 00:35:56,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:56,708 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:35:56,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:35:56,709 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:35:56,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba1a57f4-6027-4e19-ab8f-5df5022599ab/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process