./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.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_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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_3989193d-925e-455a-8be9-019930c2641f/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 d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- 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-25 22:36:31,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:36:31,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:36:31,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:36:31,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:36:31,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:36:31,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:36:31,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:36:31,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:36:31,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:36:31,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:36:31,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:36:31,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:36:31,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:36:31,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:36:31,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:36:31,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:36:31,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:36:31,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:36:31,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:36:31,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:36:31,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:36:31,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:36:31,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:36:31,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:36:31,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:36:31,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:36:31,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:36:31,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:36:31,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:36:31,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:36:31,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:36:31,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:36:31,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:36:31,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:36:31,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:36:31,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:36:31,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:36:31,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:36:31,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:36:31,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:36:31,651 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 22:36:31,691 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:36:31,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:36:31,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:36:31,693 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:36:31,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:36:31,694 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:36:31,694 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:36:31,694 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:36:31,695 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:36:31,695 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:36:31,696 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:36:31,696 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:36:31,696 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:36:31,697 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:36:31,697 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:36:31,697 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:36:31,697 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:36:31,698 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:36:31,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:36:31,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:36:31,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:36:31,699 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:36:31,699 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:36:31,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:36:31,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:36:31,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:36:31,700 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:36:31,701 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:36:31,701 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:36:31,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:36:31,702 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:36:31,702 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:36:31,702 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:36:31,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:36:31,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:36:31,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:36:31,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:36:31,703 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:36:31,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:36:31,704 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:36:31,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:36:31,704 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:36:31,705 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_3989193d-925e-455a-8be9-019930c2641f/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_3989193d-925e-455a-8be9-019930c2641f/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 -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2022-11-25 22:36:32,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:36:32,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:36:32,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:36:32,060 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:36:32,061 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:36:32,062 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2022-11-25 22:36:35,211 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:36:35,569 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:36:35,570 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2022-11-25 22:36:35,595 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/data/1efe5e7c7/c01f103af33c4e68a41c1f80d27c6115/FLAG4f21ae843 [2022-11-25 22:36:35,615 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/data/1efe5e7c7/c01f103af33c4e68a41c1f80d27c6115 [2022-11-25 22:36:35,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:36:35,622 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:36:35,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:36:35,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:36:35,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:36:35,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:36:35" (1/1) ... [2022-11-25 22:36:35,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc48aa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:35, skipping insertion in model container [2022-11-25 22:36:35,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:36:35" (1/1) ... [2022-11-25 22:36:35,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:36:35,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:36:36,424 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44118,44131] [2022-11-25 22:36:36,443 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44660,44673] [2022-11-25 22:36:36,446 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:36:36,574 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56247,56260] [2022-11-25 22:36:36,575 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56368,56381] [2022-11-25 22:36:36,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:36:36,616 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-25 22:36:36,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1f796ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:36, skipping insertion in model container [2022-11-25 22:36:36,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:36:36,624 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 22:36:36,625 INFO L158 Benchmark]: Toolchain (without parser) took 1002.76ms. Allocated memory is still 174.1MB. Free memory was 125.0MB in the beginning and 102.5MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 22:36:36,626 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 82.4MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:36:36,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1000.21ms. Allocated memory is still 174.1MB. Free memory was 124.5MB in the beginning and 102.5MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 22:36:36,628 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 82.4MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1000.21ms. Allocated memory is still 174.1MB. Free memory was 124.5MB in the beginning and 102.5MB in the end (delta: 22.0MB). 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_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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_3989193d-925e-455a-8be9-019930c2641f/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 d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- 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-25 22:36:38,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:36:38,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:36:38,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:36:38,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:36:38,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:36:38,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:36:38,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:36:38,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:36:38,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:36:39,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:36:39,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:36:39,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:36:39,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:36:39,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:36:39,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:36:39,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:36:39,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:36:39,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:36:39,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:36:39,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:36:39,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:36:39,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:36:39,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:36:39,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:36:39,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:36:39,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:36:39,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:36:39,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:36:39,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:36:39,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:36:39,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:36:39,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:36:39,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:36:39,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:36:39,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:36:39,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:36:39,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:36:39,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:36:39,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:36:39,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:36:39,052 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-25 22:36:39,106 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:36:39,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:36:39,113 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:36:39,113 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:36:39,114 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:36:39,115 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:36:39,115 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:36:39,116 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:36:39,116 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:36:39,116 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:36:39,117 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:36:39,118 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:36:39,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:36:39,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:36:39,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:36:39,119 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:36:39,120 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:36:39,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:36:39,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:36:39,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:36:39,121 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:36:39,121 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:36:39,121 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:36:39,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:36:39,122 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:36:39,122 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 22:36:39,122 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 22:36:39,123 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:36:39,123 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:36:39,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:36:39,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 22:36:39,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:36:39,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:36:39,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:36:39,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:36:39,125 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 22:36:39,125 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 22:36:39,126 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:36:39,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 22:36:39,126 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_3989193d-925e-455a-8be9-019930c2641f/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_3989193d-925e-455a-8be9-019930c2641f/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 -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2022-11-25 22:36:39,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:36:39,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:36:39,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:36:39,572 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:36:39,573 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:36:39,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2022-11-25 22:36:42,646 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:36:43,038 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:36:43,039 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2022-11-25 22:36:43,055 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/data/a2e5fcb6a/8852a6cae9154299b301b88c7728256c/FLAG470b4f7c3 [2022-11-25 22:36:43,074 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/data/a2e5fcb6a/8852a6cae9154299b301b88c7728256c [2022-11-25 22:36:43,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:36:43,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:36:43,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:36:43,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:36:43,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:36:43,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:36:43" (1/1) ... [2022-11-25 22:36:43,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@192d324f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:43, skipping insertion in model container [2022-11-25 22:36:43,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:36:43" (1/1) ... [2022-11-25 22:36:43,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:36:43,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:36:43,802 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44118,44131] [2022-11-25 22:36:43,817 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44660,44673] [2022-11-25 22:36:43,820 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:36:43,951 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56247,56260] [2022-11-25 22:36:43,952 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56368,56381] [2022-11-25 22:36:43,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:36:43,981 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 22:36:43,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:36:44,017 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44118,44131] [2022-11-25 22:36:44,020 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44660,44673] [2022-11-25 22:36:44,021 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:36:44,107 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56247,56260] [2022-11-25 22:36:44,109 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56368,56381] [2022-11-25 22:36:44,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:36:44,136 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:36:44,181 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44118,44131] [2022-11-25 22:36:44,193 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44660,44673] [2022-11-25 22:36:44,196 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:36:44,258 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56247,56260] [2022-11-25 22:36:44,273 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_3989193d-925e-455a-8be9-019930c2641f/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56368,56381] [2022-11-25 22:36:44,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:36:44,354 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:36:44,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:44 WrapperNode [2022-11-25 22:36:44,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:36:44,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:36:44,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:36:44,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:36:44,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:44" (1/1) ... [2022-11-25 22:36:44,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:44" (1/1) ... [2022-11-25 22:36:44,519 INFO L138 Inliner]: procedures = 285, calls = 347, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1200 [2022-11-25 22:36:44,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:36:44,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:36:44,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:36:44,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:36:44,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:44" (1/1) ... [2022-11-25 22:36:44,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:44" (1/1) ... [2022-11-25 22:36:44,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:44" (1/1) ... [2022-11-25 22:36:44,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:44" (1/1) ... [2022-11-25 22:36:44,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:44" (1/1) ... [2022-11-25 22:36:44,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:44" (1/1) ... [2022-11-25 22:36:44,647 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:44" (1/1) ... [2022-11-25 22:36:44,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:44" (1/1) ... [2022-11-25 22:36:44,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:36:44,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:36:44,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:36:44,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:36:44,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:44" (1/1) ... [2022-11-25 22:36:44,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:36:44,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:36:44,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:36:44,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:36:44,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 22:36:44,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 22:36:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:36:44,761 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-25 22:36:44,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 22:36:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:36:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 22:36:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 22:36:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2022-11-25 22:36:44,764 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2022-11-25 22:36:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 22:36:44,765 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 22:36:44,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 22:36:44,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:36:44,765 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2022-11-25 22:36:44,766 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2022-11-25 22:36:44,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 22:36:44,766 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2022-11-25 22:36:44,766 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2022-11-25 22:36:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:36:44,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:36:45,098 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:36:45,100 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:36:50,679 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:36:50,696 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:36:50,696 INFO L300 CfgBuilder]: Removed 72 assume(true) statements. [2022-11-25 22:36:50,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:36:50 BoogieIcfgContainer [2022-11-25 22:36:50,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:36:50,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:36:50,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:36:50,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:36:50,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:36:43" (1/3) ... [2022-11-25 22:36:50,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f7974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:36:50, skipping insertion in model container [2022-11-25 22:36:50,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:44" (2/3) ... [2022-11-25 22:36:50,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f7974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:36:50, skipping insertion in model container [2022-11-25 22:36:50,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:36:50" (3/3) ... [2022-11-25 22:36:50,710 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-2.i [2022-11-25 22:36:50,729 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:36:50,729 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 634 error locations. [2022-11-25 22:36:50,810 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:36:50,819 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;@28081f12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:36:50,820 INFO L358 AbstractCegarLoop]: Starting to check reachability of 634 error locations. [2022-11-25 22:36:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 1279 states, 625 states have (on average 2.2448) internal successors, (1403), 1259 states have internal predecessors, (1403), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 22:36:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 22:36:50,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:50,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 22:36:50,839 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:36:50,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2022-11-25 22:36:50,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:50,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661524895] [2022-11-25 22:36:50,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:50,861 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-25 22:36:50,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:50,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:36:50,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:36:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:51,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:36:51,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:51,190 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-25 22:36:51,215 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-25 22:36:51,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:51,216 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:51,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661524895] [2022-11-25 22:36:51,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661524895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:51,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:51,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:36:51,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487003945] [2022-11-25 22:36:51,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:51,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:36:51,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:51,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:36:51,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:36:51,267 INFO L87 Difference]: Start difference. First operand has 1279 states, 625 states have (on average 2.2448) internal successors, (1403), 1259 states have internal predecessors, (1403), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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-25 22:36:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:54,285 INFO L93 Difference]: Finished difference Result 1536 states and 1625 transitions. [2022-11-25 22:36:54,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:36:54,287 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-25 22:36:54,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:54,311 INFO L225 Difference]: With dead ends: 1536 [2022-11-25 22:36:54,315 INFO L226 Difference]: Without dead ends: 1534 [2022-11-25 22:36:54,317 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-25 22:36:54,323 INFO L413 NwaCegarLoop]: 909 mSDtfsCounter, 906 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:54,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1254 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-25 22:36:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2022-11-25 22:36:54,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1299. [2022-11-25 22:36:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 659 states have (on average 2.1062215477996964) internal successors, (1388), 1280 states have internal predecessors, (1388), 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-25 22:36:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1418 transitions. [2022-11-25 22:36:54,469 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1418 transitions. Word has length 3 [2022-11-25 22:36:54,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:54,470 INFO L495 AbstractCegarLoop]: Abstraction has 1299 states and 1418 transitions. [2022-11-25 22:36:54,470 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-25 22:36:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1418 transitions. [2022-11-25 22:36:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 22:36:54,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:54,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 22:36:54,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:36:54,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:36:54,690 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:36:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:54,692 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2022-11-25 22:36:54,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:54,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335182266] [2022-11-25 22:36:54,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:54,701 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-25 22:36:54,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:54,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:36:54,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:36:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:54,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:36:54,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:54,932 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-25 22:36:54,945 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-25 22:36:54,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:54,946 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:54,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335182266] [2022-11-25 22:36:54,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335182266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:54,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:54,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:36:54,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374533691] [2022-11-25 22:36:54,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:54,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:36:54,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:54,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:36:54,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:36:54,950 INFO L87 Difference]: Start difference. First operand 1299 states and 1418 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-25 22:36:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:59,405 INFO L93 Difference]: Finished difference Result 1890 states and 2056 transitions. [2022-11-25 22:36:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:36:59,405 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-25 22:36:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:59,412 INFO L225 Difference]: With dead ends: 1890 [2022-11-25 22:36:59,412 INFO L226 Difference]: Without dead ends: 1890 [2022-11-25 22:36:59,413 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-25 22:36:59,414 INFO L413 NwaCegarLoop]: 1053 mSDtfsCounter, 624 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:59,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1754 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-25 22:36:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2022-11-25 22:36:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1503. [2022-11-25 22:36:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 862 states have (on average 2.0881670533642693) internal successors, (1800), 1482 states have internal predecessors, (1800), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-25 22:36:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1834 transitions. [2022-11-25 22:36:59,454 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1834 transitions. Word has length 3 [2022-11-25 22:36:59,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:59,454 INFO L495 AbstractCegarLoop]: Abstraction has 1503 states and 1834 transitions. [2022-11-25 22:36:59,454 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-25 22:36:59,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1834 transitions. [2022-11-25 22:36:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:36:59,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:59,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:59,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:59,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:36:59,667 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:36:59,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2022-11-25 22:36:59,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:59,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525884941] [2022-11-25 22:36:59,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:59,668 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-25 22:36:59,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:59,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:36:59,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:36:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:59,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:36:59,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:59,894 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-25 22:36:59,901 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-25 22:36:59,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:59,986 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-25 22:37:00,016 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:37:00,017 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-25 22:37:00,052 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-25 22:37:00,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:00,053 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:00,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525884941] [2022-11-25 22:37:00,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525884941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:00,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:00,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:37:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800225665] [2022-11-25 22:37:00,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:00,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:37:00,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:00,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:37:00,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:37:00,056 INFO L87 Difference]: Start difference. First operand 1503 states and 1834 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-25 22:37:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:07,449 INFO L93 Difference]: Finished difference Result 2568 states and 2977 transitions. [2022-11-25 22:37:07,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:37:07,451 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-25 22:37:07,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:07,460 INFO L225 Difference]: With dead ends: 2568 [2022-11-25 22:37:07,461 INFO L226 Difference]: Without dead ends: 2568 [2022-11-25 22:37:07,461 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-25 22:37:07,462 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 1109 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 2206 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:07,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1808 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2206 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-11-25 22:37:07,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-11-25 22:37:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 1648. [2022-11-25 22:37:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1007 states have (on average 2.0685203574975173) internal successors, (2083), 1627 states have internal predecessors, (2083), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-25 22:37:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2117 transitions. [2022-11-25 22:37:07,506 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2117 transitions. Word has length 8 [2022-11-25 22:37:07,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:07,506 INFO L495 AbstractCegarLoop]: Abstraction has 1648 states and 2117 transitions. [2022-11-25 22:37:07,507 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-25 22:37:07,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2117 transitions. [2022-11-25 22:37:07,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 22:37:07,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:07,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:37:07,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:07,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:07,723 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:07,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:07,724 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2022-11-25 22:37:07,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:07,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360834343] [2022-11-25 22:37:07,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:07,725 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-25 22:37:07,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:07,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:07,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:07,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:37:07,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:07,914 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-25 22:37:07,945 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-25 22:37:07,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:07,945 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:07,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360834343] [2022-11-25 22:37:07,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360834343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:07,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:07,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:37:07,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112244696] [2022-11-25 22:37:07,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:07,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:37:07,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:07,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:37:07,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:37:07,952 INFO L87 Difference]: Start difference. First operand 1648 states and 2117 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-25 22:37:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:12,519 INFO L93 Difference]: Finished difference Result 2810 states and 3510 transitions. [2022-11-25 22:37:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:37:12,521 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-25 22:37:12,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:12,531 INFO L225 Difference]: With dead ends: 2810 [2022-11-25 22:37:12,531 INFO L226 Difference]: Without dead ends: 2810 [2022-11-25 22:37:12,532 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-25 22:37:12,533 INFO L413 NwaCegarLoop]: 1319 mSDtfsCounter, 2331 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2337 SdHoareTripleChecker+Valid, 2575 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:12,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2337 Valid, 2575 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-25 22:37:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2022-11-25 22:37:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 1603. [2022-11-25 22:37:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1007 states have (on average 2.009930486593843) internal successors, (2024), 1582 states have internal predecessors, (2024), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-25 22:37:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2058 transitions. [2022-11-25 22:37:12,576 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2058 transitions. Word has length 9 [2022-11-25 22:37:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:12,577 INFO L495 AbstractCegarLoop]: Abstraction has 1603 states and 2058 transitions. [2022-11-25 22:37:12,577 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-25 22:37:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2058 transitions. [2022-11-25 22:37:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 22:37:12,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:12,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:37:12,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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)] Ended with exit code 0 [2022-11-25 22:37:12,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:12,789 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:12,790 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2022-11-25 22:37:12,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:12,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811824028] [2022-11-25 22:37:12,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:12,791 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-25 22:37:12,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:12,792 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:12,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:12,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:37:12,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:12,979 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-25 22:37:13,034 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-25 22:37:13,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:13,035 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:13,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811824028] [2022-11-25 22:37:13,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811824028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:13,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:13,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:37:13,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092653261] [2022-11-25 22:37:13,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:13,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:37:13,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:13,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:37:13,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:37:13,037 INFO L87 Difference]: Start difference. First operand 1603 states and 2058 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-25 22:37:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:18,573 INFO L93 Difference]: Finished difference Result 2439 states and 3103 transitions. [2022-11-25 22:37:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:37:18,574 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-25 22:37:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:18,582 INFO L225 Difference]: With dead ends: 2439 [2022-11-25 22:37:18,582 INFO L226 Difference]: Without dead ends: 2439 [2022-11-25 22:37:18,582 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-25 22:37:18,583 INFO L413 NwaCegarLoop]: 1511 mSDtfsCounter, 1581 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:18,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 2714 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-25 22:37:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2022-11-25 22:37:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 1593. [2022-11-25 22:37:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1007 states have (on average 1.9860973187686197) internal successors, (2000), 1572 states have internal predecessors, (2000), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-25 22:37:18,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2034 transitions. [2022-11-25 22:37:18,622 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2034 transitions. Word has length 9 [2022-11-25 22:37:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:18,622 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 2034 transitions. [2022-11-25 22:37:18,623 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-25 22:37:18,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2034 transitions. [2022-11-25 22:37:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:37:18,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:18,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:37:18,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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)] Forceful destruction successful, exit code 0 [2022-11-25 22:37:18,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:18,836 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr516ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:18,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:18,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1033799265, now seen corresponding path program 1 times [2022-11-25 22:37:18,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:18,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161181685] [2022-11-25 22:37:18,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:18,837 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-25 22:37:18,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:18,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:18,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:19,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:37:19,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:37:19,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:19,098 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:19,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161181685] [2022-11-25 22:37:19,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161181685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:19,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:19,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:37:19,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195782552] [2022-11-25 22:37:19,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:19,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:37:19,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:19,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:37:19,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:37:19,100 INFO L87 Difference]: Start difference. First operand 1593 states and 2034 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-25 22:37:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:20,160 INFO L93 Difference]: Finished difference Result 2263 states and 2807 transitions. [2022-11-25 22:37:20,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:37:20,163 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-25 22:37:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:20,171 INFO L225 Difference]: With dead ends: 2263 [2022-11-25 22:37:20,171 INFO L226 Difference]: Without dead ends: 2263 [2022-11-25 22:37:20,171 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-25 22:37:20,172 INFO L413 NwaCegarLoop]: 1452 mSDtfsCounter, 749 mSDsluCounter, 2415 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 3867 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:20,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 3867 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 22:37:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2022-11-25 22:37:20,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1851. [2022-11-25 22:37:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1262 states have (on average 1.9904912836767037) internal successors, (2512), 1827 states have internal predecessors, (2512), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-25 22:37:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2552 transitions. [2022-11-25 22:37:20,211 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2552 transitions. Word has length 11 [2022-11-25 22:37:20,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:20,212 INFO L495 AbstractCegarLoop]: Abstraction has 1851 states and 2552 transitions. [2022-11-25 22:37:20,212 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-25 22:37:20,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2552 transitions. [2022-11-25 22:37:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 22:37:20,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:20,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:37:20,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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)] Ended with exit code 0 [2022-11-25 22:37:20,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:20,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:20,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:20,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1306900600, now seen corresponding path program 1 times [2022-11-25 22:37:20,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:20,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419834817] [2022-11-25 22:37:20,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:20,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:37:20,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:20,427 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:20,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:20,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:37:20,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:20,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:37:20,668 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:37:20,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:37:20,674 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-25 22:37:20,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:37:20,741 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-25 22:37:20,761 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-25 22:37:20,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:20,762 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:20,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419834817] [2022-11-25 22:37:20,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419834817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:20,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:20,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:37:20,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551309874] [2022-11-25 22:37:20,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:20,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:37:20,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:20,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:37:20,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:37:20,764 INFO L87 Difference]: Start difference. First operand 1851 states and 2552 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-25 22:37:22,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:22,775 INFO L93 Difference]: Finished difference Result 1999 states and 2407 transitions. [2022-11-25 22:37:22,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:37:22,777 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-25 22:37:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:22,781 INFO L225 Difference]: With dead ends: 1999 [2022-11-25 22:37:22,781 INFO L226 Difference]: Without dead ends: 1999 [2022-11-25 22:37:22,782 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-25 22:37:22,782 INFO L413 NwaCegarLoop]: 1384 mSDtfsCounter, 502 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 3856 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:22,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 3856 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-25 22:37:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2022-11-25 22:37:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1493. [2022-11-25 22:37:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 906 states have (on average 1.9757174392935983) internal successors, (1790), 1471 states have internal predecessors, (1790), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 22:37:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1826 transitions. [2022-11-25 22:37:22,812 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1826 transitions. Word has length 14 [2022-11-25 22:37:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:22,813 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 1826 transitions. [2022-11-25 22:37:22,813 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-25 22:37:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1826 transitions. [2022-11-25 22:37:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 22:37:22,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:22,814 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-25 22:37:22,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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)] Forceful destruction successful, exit code 0 [2022-11-25 22:37:23,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:23,026 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:23,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:23,027 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2022-11-25 22:37:23,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:23,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443365939] [2022-11-25 22:37:23,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:23,027 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-25 22:37:23,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:23,028 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:23,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:23,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 22:37:23,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:23,266 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-25 22:37:23,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:23,267 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:23,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443365939] [2022-11-25 22:37:23,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443365939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:23,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:23,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:37:23,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650142755] [2022-11-25 22:37:23,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:23,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:37:23,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:23,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:37:23,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:37:23,269 INFO L87 Difference]: Start difference. First operand 1493 states and 1826 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-25 22:37:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:23,300 INFO L93 Difference]: Finished difference Result 1433 states and 1740 transitions. [2022-11-25 22:37:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:37:23,301 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-25 22:37:23,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:23,306 INFO L225 Difference]: With dead ends: 1433 [2022-11-25 22:37:23,306 INFO L226 Difference]: Without dead ends: 1433 [2022-11-25 22:37:23,307 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-25 22:37:23,307 INFO L413 NwaCegarLoop]: 1237 mSDtfsCounter, 1163 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 1306 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-25 22:37:23,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 1306 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:37:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2022-11-25 22:37:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2022-11-25 22:37:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 870 states have (on average 1.9586206896551723) internal successors, (1704), 1411 states have internal predecessors, (1704), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 22:37:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1740 transitions. [2022-11-25 22:37:23,339 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1740 transitions. Word has length 19 [2022-11-25 22:37:23,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:23,340 INFO L495 AbstractCegarLoop]: Abstraction has 1433 states and 1740 transitions. [2022-11-25 22:37:23,340 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-25 22:37:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1740 transitions. [2022-11-25 22:37:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 22:37:23,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:23,358 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-25 22:37:23,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:23,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:23,571 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:23,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2022-11-25 22:37:23,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:23,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126540018] [2022-11-25 22:37:23,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:23,572 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-25 22:37:23,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:23,573 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:23,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:23,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:37:23,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:23,817 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-25 22:37:23,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:23,818 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:23,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126540018] [2022-11-25 22:37:23,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126540018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:23,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:23,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:37:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746500090] [2022-11-25 22:37:23,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:23,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:37:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:23,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:37:23,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:37:23,822 INFO L87 Difference]: Start difference. First operand 1433 states and 1740 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-25 22:37:23,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:23,896 INFO L93 Difference]: Finished difference Result 1405 states and 1684 transitions. [2022-11-25 22:37:23,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:37:23,897 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-25 22:37:23,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:23,902 INFO L225 Difference]: With dead ends: 1405 [2022-11-25 22:37:23,903 INFO L226 Difference]: Without dead ends: 1405 [2022-11-25 22:37:23,903 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-25 22:37:23,903 INFO L413 NwaCegarLoop]: 1192 mSDtfsCounter, 1144 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:23,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 2446 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:37:23,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2022-11-25 22:37:23,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1403. [2022-11-25 22:37:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 854 states have (on average 1.9274004683840749) internal successors, (1646), 1381 states have internal predecessors, (1646), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 22:37:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1682 transitions. [2022-11-25 22:37:23,926 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 1682 transitions. Word has length 21 [2022-11-25 22:37:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:23,926 INFO L495 AbstractCegarLoop]: Abstraction has 1403 states and 1682 transitions. [2022-11-25 22:37:23,926 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-25 22:37:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1682 transitions. [2022-11-25 22:37:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 22:37:23,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:23,927 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-25 22:37:23,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:24,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:24,140 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:24,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:24,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2022-11-25 22:37:24,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:24,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216901993] [2022-11-25 22:37:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:24,142 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-25 22:37:24,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:24,143 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:24,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:24,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:37:24,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:24,388 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-25 22:37:24,487 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-25 22:37:24,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:24,488 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:24,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216901993] [2022-11-25 22:37:24,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216901993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:24,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:24,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:37:24,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011719837] [2022-11-25 22:37:24,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:24,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:37:24,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:24,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:37:24,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:37:24,490 INFO L87 Difference]: Start difference. First operand 1403 states and 1682 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-25 22:37:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:29,718 INFO L93 Difference]: Finished difference Result 2571 states and 3078 transitions. [2022-11-25 22:37:29,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:37:29,720 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-25 22:37:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:29,727 INFO L225 Difference]: With dead ends: 2571 [2022-11-25 22:37:29,727 INFO L226 Difference]: Without dead ends: 2571 [2022-11-25 22:37:29,727 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-25 22:37:29,728 INFO L413 NwaCegarLoop]: 1147 mSDtfsCounter, 2420 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2423 SdHoareTripleChecker+Valid, 2731 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:29,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2423 Valid, 2731 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-25 22:37:29,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-11-25 22:37:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 1399. [2022-11-25 22:37:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 854 states have (on average 1.9180327868852458) internal successors, (1638), 1377 states have internal predecessors, (1638), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 22:37:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1674 transitions. [2022-11-25 22:37:29,763 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1674 transitions. Word has length 35 [2022-11-25 22:37:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:29,763 INFO L495 AbstractCegarLoop]: Abstraction has 1399 states and 1674 transitions. [2022-11-25 22:37:29,764 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-25 22:37:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1674 transitions. [2022-11-25 22:37:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 22:37:29,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:29,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:37:29,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:29,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:29,965 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:29,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:29,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2022-11-25 22:37:29,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:29,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136776911] [2022-11-25 22:37:29,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:29,966 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-25 22:37:29,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:29,968 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:29,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:30,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 22:37:30,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:30,244 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-25 22:37:30,471 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-25 22:37:30,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:30,471 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136776911] [2022-11-25 22:37:30,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136776911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:30,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:30,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:37:30,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115905030] [2022-11-25 22:37:30,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:30,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:37:30,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:30,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:37:30,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:37:30,473 INFO L87 Difference]: Start difference. First operand 1399 states and 1674 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-25 22:37:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:36,736 INFO L93 Difference]: Finished difference Result 2213 states and 2657 transitions. [2022-11-25 22:37:36,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:37:36,737 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-25 22:37:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:36,743 INFO L225 Difference]: With dead ends: 2213 [2022-11-25 22:37:36,744 INFO L226 Difference]: Without dead ends: 2213 [2022-11-25 22:37:36,744 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-25 22:37:36,745 INFO L413 NwaCegarLoop]: 1538 mSDtfsCounter, 2195 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2195 SdHoareTripleChecker+Valid, 3291 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:36,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2195 Valid, 3291 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-11-25 22:37:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2022-11-25 22:37:36,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 1395. [2022-11-25 22:37:36,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 854 states have (on average 1.9086651053864168) internal successors, (1630), 1373 states have internal predecessors, (1630), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 22:37:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1666 transitions. [2022-11-25 22:37:36,772 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1666 transitions. Word has length 35 [2022-11-25 22:37:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:36,772 INFO L495 AbstractCegarLoop]: Abstraction has 1395 states and 1666 transitions. [2022-11-25 22:37:36,772 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-25 22:37:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1666 transitions. [2022-11-25 22:37:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 22:37:36,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:36,774 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-25 22:37:36,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:36,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:36,988 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:36,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:36,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2063651411, now seen corresponding path program 1 times [2022-11-25 22:37:36,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:36,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624209986] [2022-11-25 22:37:36,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:36,989 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-25 22:37:36,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:36,990 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:36,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:37,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:37:37,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:37,347 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-25 22:37:37,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:37,347 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:37,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624209986] [2022-11-25 22:37:37,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624209986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:37,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:37,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:37:37,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371207954] [2022-11-25 22:37:37,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:37,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:37:37,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:37,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:37:37,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:37:37,349 INFO L87 Difference]: Start difference. First operand 1395 states and 1666 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-25 22:37:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:37,414 INFO L93 Difference]: Finished difference Result 1383 states and 1646 transitions. [2022-11-25 22:37:37,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:37:37,415 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-25 22:37:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:37,420 INFO L225 Difference]: With dead ends: 1383 [2022-11-25 22:37:37,420 INFO L226 Difference]: Without dead ends: 1383 [2022-11-25 22:37:37,420 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-25 22:37:37,421 INFO L413 NwaCegarLoop]: 1186 mSDtfsCounter, 1113 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:37,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 2424 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:37:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2022-11-25 22:37:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2022-11-25 22:37:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 842 states have (on average 1.9121140142517814) internal successors, (1610), 1361 states have internal predecessors, (1610), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 22:37:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1646 transitions. [2022-11-25 22:37:37,444 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1646 transitions. Word has length 54 [2022-11-25 22:37:37,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:37,444 INFO L495 AbstractCegarLoop]: Abstraction has 1383 states and 1646 transitions. [2022-11-25 22:37:37,444 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-25 22:37:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1646 transitions. [2022-11-25 22:37:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 22:37:37,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:37,446 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-25 22:37:37,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:37,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:37,661 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:37,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:37,661 INFO L85 PathProgramCache]: Analyzing trace with hash -202865055, now seen corresponding path program 1 times [2022-11-25 22:37:37,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:37,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151380853] [2022-11-25 22:37:37,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:37,662 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-25 22:37:37,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:37,664 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:37,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:38,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 22:37:38,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:38,156 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 22:37:38,156 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-25 22:37:38,228 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 22:37:38,228 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-25 22:37:38,722 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-25 22:37:38,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:38,723 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:38,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151380853] [2022-11-25 22:37:38,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151380853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:38,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:38,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:37:38,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272407399] [2022-11-25 22:37:38,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:38,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:37:38,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:38,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:37:38,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:37:38,725 INFO L87 Difference]: Start difference. First operand 1383 states and 1646 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-25 22:37:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:43,910 INFO L93 Difference]: Finished difference Result 3211 states and 3774 transitions. [2022-11-25 22:37:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:37:43,912 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-25 22:37:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:43,921 INFO L225 Difference]: With dead ends: 3211 [2022-11-25 22:37:43,921 INFO L226 Difference]: Without dead ends: 3211 [2022-11-25 22:37:43,922 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-25 22:37:43,922 INFO L413 NwaCegarLoop]: 1188 mSDtfsCounter, 3186 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3186 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:43,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3186 Valid, 2330 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-25 22:37:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3211 states. [2022-11-25 22:37:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3211 to 1837. [2022-11-25 22:37:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1280 states have (on average 1.8984375) internal successors, (2430), 1802 states have internal predecessors, (2430), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-25 22:37:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2492 transitions. [2022-11-25 22:37:43,961 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2492 transitions. Word has length 62 [2022-11-25 22:37:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:43,961 INFO L495 AbstractCegarLoop]: Abstraction has 1837 states and 2492 transitions. [2022-11-25 22:37:43,961 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-25 22:37:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2492 transitions. [2022-11-25 22:37:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 22:37:43,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:43,963 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-25 22:37:43,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:44,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:44,178 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:44,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:44,178 INFO L85 PathProgramCache]: Analyzing trace with hash -202865054, now seen corresponding path program 1 times [2022-11-25 22:37:44,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:44,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516411737] [2022-11-25 22:37:44,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:44,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:37:44,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:44,180 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:44,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:44,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 22:37:44,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:44,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:37:44,699 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-25 22:37:44,783 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:37:44,783 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-25 22:37:45,520 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-25 22:37:45,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:45,520 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:45,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516411737] [2022-11-25 22:37:45,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516411737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:45,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:45,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:37:45,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995874303] [2022-11-25 22:37:45,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:45,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:37:45,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:45,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:37:45,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:37:45,522 INFO L87 Difference]: Start difference. First operand 1837 states and 2492 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-25 22:37:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:49,546 INFO L93 Difference]: Finished difference Result 1843 states and 2499 transitions. [2022-11-25 22:37:49,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:37:49,546 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-25 22:37:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:49,552 INFO L225 Difference]: With dead ends: 1843 [2022-11-25 22:37:49,552 INFO L226 Difference]: Without dead ends: 1843 [2022-11-25 22:37:49,552 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-25 22:37:49,553 INFO L413 NwaCegarLoop]: 1168 mSDtfsCounter, 111 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:49,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2396 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-25 22:37:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2022-11-25 22:37:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1842. [2022-11-25 22:37:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1284 states have (on average 1.895638629283489) internal successors, (2434), 1806 states have internal predecessors, (2434), 32 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-25 22:37:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2498 transitions. [2022-11-25 22:37:49,604 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2498 transitions. Word has length 62 [2022-11-25 22:37:49,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:49,606 INFO L495 AbstractCegarLoop]: Abstraction has 1842 states and 2498 transitions. [2022-11-25 22:37:49,606 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-25 22:37:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2498 transitions. [2022-11-25 22:37:49,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 22:37:49,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:49,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:37:49,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:49,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:49,827 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:49,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash -904346310, now seen corresponding path program 1 times [2022-11-25 22:37:49,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:49,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481654498] [2022-11-25 22:37:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:49,829 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-25 22:37:49,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:49,830 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:49,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:50,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:37:50,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:50,238 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-25 22:37:50,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:50,238 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:50,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481654498] [2022-11-25 22:37:50,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481654498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:50,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:50,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:37:50,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988365745] [2022-11-25 22:37:50,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:50,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:37:50,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:50,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:37:50,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:37:50,241 INFO L87 Difference]: Start difference. First operand 1842 states and 2498 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-25 22:37:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:50,366 INFO L93 Difference]: Finished difference Result 1868 states and 2525 transitions. [2022-11-25 22:37:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:37:50,366 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-25 22:37:50,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:50,372 INFO L225 Difference]: With dead ends: 1868 [2022-11-25 22:37:50,373 INFO L226 Difference]: Without dead ends: 1868 [2022-11-25 22:37:50,373 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-25 22:37:50,374 INFO L413 NwaCegarLoop]: 1183 mSDtfsCounter, 19 mSDsluCounter, 4722 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5905 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-25 22:37:50,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 5905 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:37:50,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2022-11-25 22:37:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1866. [2022-11-25 22:37:50,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1302 states have (on average 1.8870967741935485) internal successors, (2457), 1826 states have internal predecessors, (2457), 34 states have call successors, (34), 13 states have call predecessors, (34), 11 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2022-11-25 22:37:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2525 transitions. [2022-11-25 22:37:50,410 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2525 transitions. Word has length 68 [2022-11-25 22:37:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:50,411 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 2525 transitions. [2022-11-25 22:37:50,411 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-25 22:37:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2525 transitions. [2022-11-25 22:37:50,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 22:37:50,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:50,412 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-25 22:37:50,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:50,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:50,627 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:50,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash -961994179, now seen corresponding path program 1 times [2022-11-25 22:37:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:50,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263969789] [2022-11-25 22:37:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:50,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:37:50,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:50,630 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:50,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:50,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:37:50,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:51,183 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-25 22:37:51,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:51,183 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:51,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263969789] [2022-11-25 22:37:51,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263969789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:51,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:51,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:37:51,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593546309] [2022-11-25 22:37:51,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:51,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:37:51,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:51,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:37:51,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:37:51,186 INFO L87 Difference]: Start difference. First operand 1866 states and 2525 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-25 22:37:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:51,416 INFO L93 Difference]: Finished difference Result 1878 states and 2539 transitions. [2022-11-25 22:37:51,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:37:51,417 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-25 22:37:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:51,422 INFO L225 Difference]: With dead ends: 1878 [2022-11-25 22:37:51,422 INFO L226 Difference]: Without dead ends: 1878 [2022-11-25 22:37:51,422 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-25 22:37:51,423 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 20 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4613 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:51,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4613 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:37:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-11-25 22:37:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1869. [2022-11-25 22:37:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1304 states have (on average 1.8857361963190185) internal successors, (2459), 1828 states have internal predecessors, (2459), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2022-11-25 22:37:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2528 transitions. [2022-11-25 22:37:51,468 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2528 transitions. Word has length 68 [2022-11-25 22:37:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:51,469 INFO L495 AbstractCegarLoop]: Abstraction has 1869 states and 2528 transitions. [2022-11-25 22:37:51,469 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-25 22:37:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2528 transitions. [2022-11-25 22:37:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 22:37:51,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:51,470 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-25 22:37:51,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:51,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:51,683 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:51,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1684223946, now seen corresponding path program 1 times [2022-11-25 22:37:51,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:51,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521559980] [2022-11-25 22:37:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:51,684 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-25 22:37:51,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:51,685 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:51,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:52,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:37:52,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:52,196 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-25 22:37:52,397 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-25 22:37:52,418 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 22:37:52,419 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-25 22:37:52,432 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-25 22:37:52,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:52,433 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521559980] [2022-11-25 22:37:52,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521559980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:52,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:52,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:37:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973664076] [2022-11-25 22:37:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:52,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:37:52,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:52,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:37:52,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2022-11-25 22:37:52,436 INFO L87 Difference]: Start difference. First operand 1869 states and 2528 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-25 22:37:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:58,283 INFO L93 Difference]: Finished difference Result 3193 states and 4238 transitions. [2022-11-25 22:37:58,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:37:58,295 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-25 22:37:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:58,308 INFO L225 Difference]: With dead ends: 3193 [2022-11-25 22:37:58,309 INFO L226 Difference]: Without dead ends: 3193 [2022-11-25 22:37:58,309 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-25 22:37:58,310 INFO L413 NwaCegarLoop]: 1101 mSDtfsCounter, 1620 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 2738 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 4371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1612 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:58,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 3027 Invalid, 4371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2738 Invalid, 0 Unknown, 1612 Unchecked, 5.7s Time] [2022-11-25 22:37:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2022-11-25 22:37:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 1868. [2022-11-25 22:37:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1304 states have (on average 1.88420245398773) internal successors, (2457), 1827 states have internal predecessors, (2457), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2022-11-25 22:37:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2526 transitions. [2022-11-25 22:37:58,372 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2526 transitions. Word has length 73 [2022-11-25 22:37:58,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:58,372 INFO L495 AbstractCegarLoop]: Abstraction has 1868 states and 2526 transitions. [2022-11-25 22:37:58,373 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-25 22:37:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2526 transitions. [2022-11-25 22:37:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 22:37:58,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:58,375 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-25 22:37:58,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:58,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:58,591 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:37:58,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1684223945, now seen corresponding path program 1 times [2022-11-25 22:37:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:58,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208489220] [2022-11-25 22:37:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:58,592 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-25 22:37:58,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:58,594 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:58,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:37:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:59,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 22:37:59,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:59,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-25 22:37:59,141 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-25 22:37:59,731 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-25 22:37:59,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:37:59,763 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-25 22:37:59,774 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:37:59,774 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-25 22:37:59,796 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-25 22:37:59,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:37:59,797 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:59,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208489220] [2022-11-25 22:37:59,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208489220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:37:59,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:37:59,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:37:59,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166045917] [2022-11-25 22:37:59,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:37:59,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:37:59,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:59,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:37:59,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2022-11-25 22:37:59,799 INFO L87 Difference]: Start difference. First operand 1868 states and 2526 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-25 22:38:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:38:09,470 INFO L93 Difference]: Finished difference Result 3264 states and 4363 transitions. [2022-11-25 22:38:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:38:09,471 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-25 22:38:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:38:09,478 INFO L225 Difference]: With dead ends: 3264 [2022-11-25 22:38:09,478 INFO L226 Difference]: Without dead ends: 3264 [2022-11-25 22:38:09,478 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-25 22:38:09,479 INFO L413 NwaCegarLoop]: 1299 mSDtfsCounter, 2343 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2349 SdHoareTripleChecker+Valid, 2955 SdHoareTripleChecker+Invalid, 5892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1903 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:38:09,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2349 Valid, 2955 Invalid, 5892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3959 Invalid, 0 Unknown, 1903 Unchecked, 9.5s Time] [2022-11-25 22:38:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2022-11-25 22:38:09,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 1864. [2022-11-25 22:38:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1308 states have (on average 1.8692660550458715) internal successors, (2445), 1823 states have internal predecessors, (2445), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2022-11-25 22:38:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2514 transitions. [2022-11-25 22:38:09,532 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2514 transitions. Word has length 73 [2022-11-25 22:38:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:38:09,533 INFO L495 AbstractCegarLoop]: Abstraction has 1864 states and 2514 transitions. [2022-11-25 22:38:09,533 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-25 22:38:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2514 transitions. [2022-11-25 22:38:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-25 22:38:09,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:38:09,534 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-25 22:38:09,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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)] Ended with exit code 0 [2022-11-25 22:38:09,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:09,751 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:38:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:38:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1696557543, now seen corresponding path program 1 times [2022-11-25 22:38:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:38:09,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115746733] [2022-11-25 22:38:09,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:38:09,752 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-25 22:38:09,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:38:09,754 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:09,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:38:10,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 22:38:10,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:38:10,193 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-25 22:38:10,216 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-25 22:38:10,248 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-25 22:38:10,290 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-25 22:38:10,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:38:10,290 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:38:10,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115746733] [2022-11-25 22:38:10,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115746733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:38:10,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:38:10,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 22:38:10,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414419904] [2022-11-25 22:38:10,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:38:10,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:38:10,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:38:10,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:38:10,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:38:10,293 INFO L87 Difference]: Start difference. First operand 1864 states and 2514 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-25 22:38:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:38:16,196 INFO L93 Difference]: Finished difference Result 1879 states and 2530 transitions. [2022-11-25 22:38:16,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 22:38:16,197 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-25 22:38:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:38:16,200 INFO L225 Difference]: With dead ends: 1879 [2022-11-25 22:38:16,200 INFO L226 Difference]: Without dead ends: 1879 [2022-11-25 22:38:16,201 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-25 22:38:16,201 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 23 mSDsluCounter, 3748 mSDsCounter, 0 mSdLazyCounter, 3317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4917 SdHoareTripleChecker+Invalid, 3319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:38:16,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4917 Invalid, 3319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3317 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-25 22:38:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2022-11-25 22:38:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1878. [2022-11-25 22:38:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1320 states have (on average 1.8643939393939395) internal successors, (2461), 1835 states have internal predecessors, (2461), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2022-11-25 22:38:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2530 transitions. [2022-11-25 22:38:16,229 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2530 transitions. Word has length 80 [2022-11-25 22:38:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:38:16,229 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2530 transitions. [2022-11-25 22:38:16,230 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-25 22:38:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2530 transitions. [2022-11-25 22:38:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 22:38:16,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:38:16,231 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-25 22:38:16,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:16,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:16,446 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:38:16,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:38:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1053676349, now seen corresponding path program 1 times [2022-11-25 22:38:16,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:38:16,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272861789] [2022-11-25 22:38:16,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:38:16,447 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-25 22:38:16,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:38:16,448 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:16,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:38:16,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 22:38:16,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:38:16,846 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-25 22:38:16,910 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-25 22:38:16,920 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-25 22:38:16,978 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-25 22:38:16,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:38:17,104 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-25 22:38:17,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:38:17,105 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:38:17,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272861789] [2022-11-25 22:38:17,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272861789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:38:17,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:38:17,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 22:38:17,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463756637] [2022-11-25 22:38:17,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:38:17,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 22:38:17,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:38:17,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 22:38:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:38:17,107 INFO L87 Difference]: Start difference. First operand 1878 states and 2530 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-25 22:38:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:38:25,541 INFO L93 Difference]: Finished difference Result 1878 states and 2528 transitions. [2022-11-25 22:38:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 22:38:25,542 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-25 22:38:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:38:25,545 INFO L225 Difference]: With dead ends: 1878 [2022-11-25 22:38:25,545 INFO L226 Difference]: Without dead ends: 1878 [2022-11-25 22:38:25,546 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-25 22:38:25,546 INFO L413 NwaCegarLoop]: 1164 mSDtfsCounter, 19 mSDsluCounter, 4769 mSDsCounter, 0 mSdLazyCounter, 3477 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5933 SdHoareTripleChecker+Invalid, 3478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:38:25,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 5933 Invalid, 3478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3477 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-11-25 22:38:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-11-25 22:38:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1878. [2022-11-25 22:38:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1320 states have (on average 1.8628787878787878) internal successors, (2459), 1835 states have internal predecessors, (2459), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2022-11-25 22:38:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2528 transitions. [2022-11-25 22:38:25,573 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2528 transitions. Word has length 81 [2022-11-25 22:38:25,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:38:25,573 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2528 transitions. [2022-11-25 22:38:25,574 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-25 22:38:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2528 transitions. [2022-11-25 22:38:25,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-25 22:38:25,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:38:25,575 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-25 22:38:25,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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)] Forceful destruction successful, exit code 0 [2022-11-25 22:38:25,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:25,790 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:38:25,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:38:25,791 INFO L85 PathProgramCache]: Analyzing trace with hash 491350102, now seen corresponding path program 1 times [2022-11-25 22:38:25,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:38:25,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347176258] [2022-11-25 22:38:25,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:38:25,792 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-25 22:38:25,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:38:25,794 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:25,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:38:26,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:38:26,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:38:26,270 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-25 22:38:26,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:38:26,270 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:38:26,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347176258] [2022-11-25 22:38:26,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347176258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:38:26,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:38:26,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:38:26,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914650084] [2022-11-25 22:38:26,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:38:26,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:38:26,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:38:26,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:38:26,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:38:26,272 INFO L87 Difference]: Start difference. First operand 1878 states and 2528 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-25 22:38:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:38:26,368 INFO L93 Difference]: Finished difference Result 1894 states and 2546 transitions. [2022-11-25 22:38:26,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:38:26,369 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-25 22:38:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:38:26,373 INFO L225 Difference]: With dead ends: 1894 [2022-11-25 22:38:26,373 INFO L226 Difference]: Without dead ends: 1888 [2022-11-25 22:38:26,373 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-25 22:38:26,374 INFO L413 NwaCegarLoop]: 1172 mSDtfsCounter, 10 mSDsluCounter, 3500 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4672 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:38:26,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4672 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:38:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2022-11-25 22:38:26,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1888. [2022-11-25 22:38:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1328 states have (on average 1.8591867469879517) internal successors, (2469), 1845 states have internal predecessors, (2469), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2022-11-25 22:38:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2540 transitions. [2022-11-25 22:38:26,400 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2540 transitions. Word has length 88 [2022-11-25 22:38:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:38:26,400 INFO L495 AbstractCegarLoop]: Abstraction has 1888 states and 2540 transitions. [2022-11-25 22:38:26,400 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-25 22:38:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2540 transitions. [2022-11-25 22:38:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 22:38:26,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:38:26,402 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-25 22:38:26,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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)] Ended with exit code 0 [2022-11-25 22:38:26,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:26,617 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:38:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:38:26,618 INFO L85 PathProgramCache]: Analyzing trace with hash -385822936, now seen corresponding path program 1 times [2022-11-25 22:38:26,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:38:26,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036575080] [2022-11-25 22:38:26,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:38:26,618 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-25 22:38:26,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:38:26,620 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:26,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:38:27,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:38:27,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:38:27,139 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-25 22:38:27,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:38:27,322 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-25 22:38:27,322 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:38:27,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036575080] [2022-11-25 22:38:27,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036575080] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:38:27,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1371859835] [2022-11-25 22:38:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:38:27,323 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:38:27,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:38:27,331 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:38:27,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-25 22:38:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:38:28,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:38:28,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:38:28,072 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-25 22:38:28,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:38:28,150 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-25 22:38:28,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1371859835] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:38:28,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702294343] [2022-11-25 22:38:28,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:38:28,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:38:28,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:38:28,159 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:38:28,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-25 22:38:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:38:28,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:38:28,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:38:28,604 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-25 22:38:28,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:38:28,692 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-25 22:38:28,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702294343] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:38:28,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:38:28,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2022-11-25 22:38:28,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837501459] [2022-11-25 22:38:28,694 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:38:28,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 22:38:28,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:38:28,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 22:38:28,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 22:38:28,715 INFO L87 Difference]: Start difference. First operand 1888 states and 2540 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-25 22:38:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:38:29,043 INFO L93 Difference]: Finished difference Result 1914 states and 2570 transitions. [2022-11-25 22:38:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 22:38:29,046 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-25 22:38:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:38:29,050 INFO L225 Difference]: With dead ends: 1914 [2022-11-25 22:38:29,050 INFO L226 Difference]: Without dead ends: 1902 [2022-11-25 22:38:29,050 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-25 22:38:29,051 INFO L413 NwaCegarLoop]: 1175 mSDtfsCounter, 36 mSDsluCounter, 7006 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 8181 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:38:29,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 8181 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:38:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2022-11-25 22:38:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1896. [2022-11-25 22:38:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1336 states have (on average 1.8555389221556886) internal successors, (2479), 1853 states have internal predecessors, (2479), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2022-11-25 22:38:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2550 transitions. [2022-11-25 22:38:29,079 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2550 transitions. Word has length 89 [2022-11-25 22:38:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:38:29,079 INFO L495 AbstractCegarLoop]: Abstraction has 1896 states and 2550 transitions. [2022-11-25 22:38:29,079 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-25 22:38:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2550 transitions. [2022-11-25 22:38:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-25 22:38:29,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:38:29,081 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-25 22:38:29,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-11-25 22:38:29,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:29,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-25 22:38:29,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:38:29,689 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:38:29,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:38:29,689 INFO L85 PathProgramCache]: Analyzing trace with hash 55938262, now seen corresponding path program 2 times [2022-11-25 22:38:29,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:38:29,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132015082] [2022-11-25 22:38:29,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:38:29,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:38:29,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:38:29,691 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:29,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:38:30,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:38:30,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:38:30,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 22:38:30,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:38:30,509 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-25 22:38:30,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:38:30,888 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-25 22:38:30,889 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:38:30,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132015082] [2022-11-25 22:38:30,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132015082] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:38:30,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1294775190] [2022-11-25 22:38:30,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:38:30,890 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:38:30,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:38:30,891 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:38:30,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-25 22:38:33,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:38:33,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:38:33,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 22:38:33,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:38:33,481 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-25 22:38:33,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:38:33,607 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-25 22:38:33,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1294775190] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:38:33,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394326001] [2022-11-25 22:38:33,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:38:33,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:38:33,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:38:33,611 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:38:33,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-25 22:39:28,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:39:28,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:39:28,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 22:39:28,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:39:28,618 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:39:28,618 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-25 22:39:28,662 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-25 22:39:29,313 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:39:29,313 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-25 22:39:29,413 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-25 22:39:29,460 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-25 22:39:29,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:39:29,634 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-25 22:39:29,634 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-25 22:39:29,645 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-25 22:39:29,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394326001] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:39:29,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-25 22:39:29,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 14] total 29 [2022-11-25 22:39:29,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754331050] [2022-11-25 22:39:29,648 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-25 22:39:29,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 22:39:29,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:39:29,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 22:39:29,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=756, Unknown=3, NotChecked=56, Total=930 [2022-11-25 22:39:29,650 INFO L87 Difference]: Start difference. First operand 1896 states and 2550 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-25 22:39:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:39:50,938 INFO L93 Difference]: Finished difference Result 2415 states and 3208 transitions. [2022-11-25 22:39:50,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-25 22:39:50,938 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-25 22:39:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:39:50,943 INFO L225 Difference]: With dead ends: 2415 [2022-11-25 22:39:50,943 INFO L226 Difference]: Without dead ends: 2403 [2022-11-25 22:39:50,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=645, Invalid=3478, Unknown=41, NotChecked=126, Total=4290 [2022-11-25 22:39:50,945 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 968 mSDsluCounter, 10804 mSDsCounter, 0 mSdLazyCounter, 9644 mSolverCounterSat, 59 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 11521 SdHoareTripleChecker+Invalid, 9711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 9644 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:39:50,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 11521 Invalid, 9711 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 9644 Invalid, 8 Unknown, 0 Unchecked, 19.0s Time] [2022-11-25 22:39:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2022-11-25 22:39:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1913. [2022-11-25 22:39:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1354 states have (on average 1.8471196454948302) internal successors, (2501), 1870 states have internal predecessors, (2501), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2022-11-25 22:39:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2572 transitions. [2022-11-25 22:39:50,975 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2572 transitions. Word has length 92 [2022-11-25 22:39:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:39:50,976 INFO L495 AbstractCegarLoop]: Abstraction has 1913 states and 2572 transitions. [2022-11-25 22:39:50,976 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-25 22:39:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2572 transitions. [2022-11-25 22:39:50,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-25 22:39:50,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:39:50,977 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-25 22:39:50,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-11-25 22:39:51,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-25 22:39:51,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:39:51,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:39:51,587 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:39:51,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:39:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash 675941271, now seen corresponding path program 1 times [2022-11-25 22:39:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:39:51,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291035411] [2022-11-25 22:39:51,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:39:51,588 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-25 22:39:51,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:39:51,589 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:39:51,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:39:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:39:52,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 22:39:52,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:39:52,368 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-25 22:39:52,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:39:53,355 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-25 22:39:53,355 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:39:53,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291035411] [2022-11-25 22:39:53,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291035411] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:39:53,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1990384395] [2022-11-25 22:39:53,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:39:53,356 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:39:53,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:39:53,363 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:39:53,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-25 22:39:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:39:54,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 22:39:54,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:39:54,311 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-25 22:39:54,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:39:54,573 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-25 22:39:54,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1990384395] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:39:54,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16608542] [2022-11-25 22:39:54,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:39:54,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:39:54,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:39:54,575 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:39:54,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-25 22:39:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:39:55,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 22:39:55,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:39:55,211 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-25 22:39:55,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:39:57,180 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-25 22:39:57,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16608542] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:39:57,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:39:57,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15, 15] total 41 [2022-11-25 22:39:57,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060266840] [2022-11-25 22:39:57,181 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:39:57,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-25 22:39:57,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:39:57,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-25 22:39:57,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1187, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 22:39:57,184 INFO L87 Difference]: Start difference. First operand 1913 states and 2572 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-25 22:40:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:40:02,057 INFO L93 Difference]: Finished difference Result 2021 states and 2710 transitions. [2022-11-25 22:40:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-25 22:40:02,058 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-25 22:40:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:40:02,062 INFO L225 Difference]: With dead ends: 2021 [2022-11-25 22:40:02,062 INFO L226 Difference]: Without dead ends: 2003 [2022-11-25 22:40:02,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1810, Invalid=3890, Unknown=0, NotChecked=0, Total=5700 [2022-11-25 22:40:02,064 INFO L413 NwaCegarLoop]: 1192 mSDtfsCounter, 180 mSDsluCounter, 18937 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 20129 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:40:02,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 20129 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-25 22:40:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2022-11-25 22:40:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1949. [2022-11-25 22:40:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1390 states have (on average 1.8323741007194245) internal successors, (2547), 1906 states have internal predecessors, (2547), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2022-11-25 22:40:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2618 transitions. [2022-11-25 22:40:02,092 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2618 transitions. Word has length 98 [2022-11-25 22:40:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:40:02,093 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 2618 transitions. [2022-11-25 22:40:02,093 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-25 22:40:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2618 transitions. [2022-11-25 22:40:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-25 22:40:02,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:40:02,094 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-25 22:40:02,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:40:02,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-11-25 22:40:02,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-25 22:40:02,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:40:02,712 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:40:02,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:40:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2055264535, now seen corresponding path program 2 times [2022-11-25 22:40:02,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:40:02,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290920510] [2022-11-25 22:40:02,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:40:02,713 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-25 22:40:02,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:40:02,714 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:40:02,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:40:03,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:40:03,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:40:03,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 22:40:03,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:40:04,462 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-25 22:40:04,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:40:11,157 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-25 22:40:11,157 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:40:11,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290920510] [2022-11-25 22:40:11,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290920510] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:40:11,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [338822637] [2022-11-25 22:40:11,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:40:11,158 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:40:11,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:40:11,159 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:40:11,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-25 22:40:13,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:40:13,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:40:13,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 22:40:13,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:40:14,086 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-25 22:40:14,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:40:16,047 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-25 22:40:16,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [338822637] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:40:16,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485770388] [2022-11-25 22:40:16,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:40:16,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:40:16,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:40:16,049 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:40:16,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-25 22:41:54,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:41:54,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:41:54,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-25 22:41:54,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:41:54,835 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-25 22:41:54,995 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:41:54,999 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-25 22:41:55,135 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-25 22:41:55,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:41:55,584 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-25 22:41:55,589 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-25 22:41:59,971 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3656 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3656))) (exists ((v_arrayElimCell_27 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_27) (_ bv44 32))) (exists ((v_ArrVal_3657 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3657)))) is different from true [2022-11-25 22:42:00,032 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:42:00,032 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-25 22:42:00,039 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-25 22:42:00,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 31 treesize of output 13 [2022-11-25 22:42:00,286 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-25 22:42:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 22 not checked. [2022-11-25 22:42:00,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:42:01,411 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_3704) |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_3705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-25 22:42:01,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485770388] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:42:01,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-25 22:42:01,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27, 27, 13] total 64 [2022-11-25 22:42:01,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820634488] [2022-11-25 22:42:01,418 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-25 22:42:01,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-25 22:42:01,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:01,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-25 22:42:01,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=3404, Unknown=3, NotChecked=254, Total=4422 [2022-11-25 22:42:01,420 INFO L87 Difference]: Start difference. First operand 1949 states and 2618 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-25 22:44:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:09,874 INFO L93 Difference]: Finished difference Result 2624 states and 3506 transitions. [2022-11-25 22:44:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-25 22:44:09,875 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-25 22:44:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:09,878 INFO L225 Difference]: With dead ends: 2624 [2022-11-25 22:44:09,879 INFO L226 Difference]: Without dead ends: 2606 [2022-11-25 22:44:09,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 461 SyntacticMatches, 25 SemanticMatches, 148 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6264 ImplicationChecksByTransitivity, 56.7s TimeCoverageRelationStatistics Valid=3676, Invalid=18057, Unknown=31, NotChecked=586, Total=22350 [2022-11-25 22:44:09,884 INFO L413 NwaCegarLoop]: 728 mSDtfsCounter, 1326 mSDsluCounter, 23074 mSDsCounter, 0 mSdLazyCounter, 24113 mSolverCounterSat, 103 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 23802 SdHoareTripleChecker+Invalid, 25524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 24113 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 1300 IncrementalHoareTripleChecker+Unchecked, 82.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:09,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 23802 Invalid, 25524 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [103 Valid, 24113 Invalid, 8 Unknown, 1300 Unchecked, 82.4s Time] [2022-11-25 22:44:09,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2022-11-25 22:44:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2020. [2022-11-25 22:44:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 1462 states have (on average 1.8064295485636115) internal successors, (2641), 1977 states have internal predecessors, (2641), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2022-11-25 22:44:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2712 transitions. [2022-11-25 22:44:09,931 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2712 transitions. Word has length 110 [2022-11-25 22:44:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:09,932 INFO L495 AbstractCegarLoop]: Abstraction has 2020 states and 2712 transitions. [2022-11-25 22:44:09,932 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-25 22:44:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2712 transitions. [2022-11-25 22:44:09,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-25 22:44:09,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:09,933 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-25 22:44:09,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:10,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:44:10,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:10,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:44:10,555 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:44:10,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1849192087, now seen corresponding path program 1 times [2022-11-25 22:44:10,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:10,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415326475] [2022-11-25 22:44:10,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:10,557 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-25 22:44:10,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:10,558 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:44:10,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:44:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:11,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-25 22:44:11,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:11,612 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-25 22:44:11,812 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:44:11,813 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-25 22:44:11,853 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-25 22:44:11,981 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-25 22:44:14,789 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:44:14,789 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-25 22:44:14,948 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:44:14,948 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-25 22:44:14,976 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-25 22:44:15,042 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-25 22:44:15,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:44:15,151 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4145) |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-25 22:44:15,165 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-25 22:44:15,536 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-25 22:44:15,539 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:44:15,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415326475] [2022-11-25 22:44:15,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415326475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:44:15,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [160034516] [2022-11-25 22:44:15,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:15,540 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:44:15,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:44:15,541 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:44:15,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-25 22:44:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:20,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 22:44:20,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:20,952 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-25 22:44:21,117 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:44:21,117 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-25 22:44:21,135 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-25 22:44:21,205 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-25 22:44:23,867 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:44:23,867 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-25 22:44:23,957 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:44:23,958 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-25 22:44:23,987 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-25 22:44:23,997 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-25 22:44:23,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:44:24,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4631) |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-25 22:44:24,033 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:44:24,384 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4677))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-25 22:44:24,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [160034516] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:44:24,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465728057] [2022-11-25 22:44:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:24,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:44:24,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:44:24,388 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:44:24,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-25 22:44:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:25,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-25 22:44:25,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:25,382 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:44:25,382 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-25 22:44:25,426 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-25 22:44:28,482 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:44:28,482 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-25 22:44:28,666 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:44:28,666 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-25 22:44:28,685 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-25 22:44:28,690 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-25 22:44:28,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:44:28,710 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-25 22:44:28,721 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2022-11-25 22:44:29,103 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-25 22:44:29,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-25 22:44:29,113 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 (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_5161))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5115)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2022-11-25 22:44:29,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465728057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:44:29,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:44:29,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 26 [2022-11-25 22:44:29,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66635606] [2022-11-25 22:44:29,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:44:29,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 22:44:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:29,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 22:44:29,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=655, Unknown=31, NotChecked=540, Total=1332 [2022-11-25 22:44:29,117 INFO L87 Difference]: Start difference. First operand 2020 states and 2712 transitions. Second operand has 27 states, 24 states have (on average 4.791666666666667) internal successors, (115), 23 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-25 22:44:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:59,667 INFO L93 Difference]: Finished difference Result 2680 states and 3509 transitions. [2022-11-25 22:44:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 22:44:59,668 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 4.791666666666667) internal successors, (115), 23 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-25 22:44:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:59,671 INFO L225 Difference]: With dead ends: 2680 [2022-11-25 22:44:59,671 INFO L226 Difference]: Without dead ends: 2680 [2022-11-25 22:44:59,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 259 SyntacticMatches, 131 SemanticMatches, 51 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=243, Invalid=1634, Unknown=51, NotChecked=828, Total=2756 [2022-11-25 22:44:59,672 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 1895 mSDsluCounter, 11158 mSDsCounter, 0 mSdLazyCounter, 12078 mSolverCounterSat, 54 mSolverCounterUnsat, 1087 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 11954 SdHoareTripleChecker+Invalid, 13219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 12078 IncrementalHoareTripleChecker+Invalid, 1087 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:59,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 11954 Invalid, 13219 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 12078 Invalid, 1087 Unknown, 0 Unchecked, 29.4s Time] [2022-11-25 22:44:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2022-11-25 22:44:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2017. [2022-11-25 22:44:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1462 states have (on average 1.802325581395349) internal successors, (2635), 1974 states have internal predecessors, (2635), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2022-11-25 22:44:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2706 transitions. [2022-11-25 22:44:59,702 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2706 transitions. Word has length 135 [2022-11-25 22:44:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:59,702 INFO L495 AbstractCegarLoop]: Abstraction has 2017 states and 2706 transitions. [2022-11-25 22:44:59,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 4.791666666666667) internal successors, (115), 23 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-25 22:44:59,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2706 transitions. [2022-11-25 22:44:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-25 22:44:59,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:59,704 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-25 22:44:59,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:59,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2022-11-25 22:45:00,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:45:00,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:45:00,319 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:45:00,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:00,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1849192088, now seen corresponding path program 1 times [2022-11-25 22:45:00,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:45:00,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7653839] [2022-11-25 22:45:00,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:00,321 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-25 22:45:00,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:45:00,321 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:45:00,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:45:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:01,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-25 22:45:01,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:01,564 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-25 22:45:01,907 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-25 22:45:01,950 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:45:01,950 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-25 22:45:01,992 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-25 22:45:02,000 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-25 22:45:02,158 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-25 22:45:02,163 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-25 22:45:04,723 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:45:04,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-25 22:45:04,732 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-25 22:45:04,901 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:45:04,902 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-25 22:45:04,913 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-25 22:45:04,942 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-25 22:45:04,949 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-25 22:45:04,994 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-25 22:45:04,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:05,246 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-25 22:45:05,291 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-25 22:45:06,504 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-25 22:45:06,516 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:45:06,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7653839] [2022-11-25 22:45:06,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7653839] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:45:06,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [559276009] [2022-11-25 22:45:06,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:06,517 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:45:06,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:45:06,519 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:45:06,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-11-25 22:45:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:11,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-25 22:45:11,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:11,223 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-25 22:45:11,229 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-25 22:45:11,946 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:45:11,946 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-25 22:45:11,958 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-25 22:45:12,048 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-25 22:45:12,060 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-25 22:45:12,190 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-25 22:45:12,284 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-25 22:45:16,998 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-25 22:45:17,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:17,278 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-25 22:45:17,299 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-25 22:45:17,299 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-25 22:45:17,465 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-25 22:45:17,469 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-25 22:45:17,609 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-25 22:45:17,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:18,142 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-25 22:45:27,392 WARN L233 SmtUtils]: Spent 7.54s 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-25 22:45:27,906 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-25 22:45:27,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [559276009] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:45:27,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387921951] [2022-11-25 22:45:27,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:27,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:45:27,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:45:27,928 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:45:27,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-25 22:45:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:28,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-25 22:45:28,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:29,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:45:29,131 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:45:29,131 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-25 22:45:29,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-25 22:45:29,291 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-25 22:45:29,678 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-25 22:45:29,692 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-25 22:45:32,623 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-25 22:45:32,683 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:45:32,683 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-25 22:45:32,694 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-25 22:45:33,103 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:45:33,103 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-25 22:45:33,110 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-25 22:45:33,146 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-25 22:45:33,157 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-25 22:45:33,163 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-25 22:45:33,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:33,253 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-25 22:45:33,302 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-25 22:45:34,407 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-25 22:45:34,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387921951] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:45:34,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:45:34,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 36 [2022-11-25 22:45:34,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140188473] [2022-11-25 22:45:34,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:45:34,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-25 22:45:34,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:45:34,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-25 22:45:34,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1390, Unknown=65, NotChecked=664, Total=2256 [2022-11-25 22:45:34,423 INFO L87 Difference]: Start difference. First operand 2017 states and 2706 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-25 22:47:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:47:06,140 INFO L93 Difference]: Finished difference Result 3372 states and 4446 transitions. [2022-11-25 22:47:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 22:47:06,141 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-25 22:47:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:47:06,144 INFO L225 Difference]: With dead ends: 3372 [2022-11-25 22:47:06,144 INFO L226 Difference]: Without dead ends: 3372 [2022-11-25 22:47:06,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 249 SyntacticMatches, 131 SemanticMatches, 61 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=280, Invalid=2629, Unknown=93, NotChecked=904, Total=3906 [2022-11-25 22:47:06,145 INFO L413 NwaCegarLoop]: 911 mSDtfsCounter, 2987 mSDsluCounter, 15285 mSDsCounter, 0 mSdLazyCounter, 31511 mSolverCounterSat, 64 mSolverCounterUnsat, 2413 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 80.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2992 SdHoareTripleChecker+Valid, 16196 SdHoareTripleChecker+Invalid, 35894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 31511 IncrementalHoareTripleChecker+Invalid, 2413 IncrementalHoareTripleChecker+Unknown, 1906 IncrementalHoareTripleChecker+Unchecked, 89.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:47:06,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2992 Valid, 16196 Invalid, 35894 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [64 Valid, 31511 Invalid, 2413 Unknown, 1906 Unchecked, 89.0s Time] [2022-11-25 22:47:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2022-11-25 22:47:06,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 2363. [2022-11-25 22:47:06,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 1796 states have (on average 1.8195991091314032) internal successors, (3268), 2310 states have internal predecessors, (3268), 44 states have call successors, (44), 19 states have call predecessors, (44), 19 states have return successors, (47), 36 states have call predecessors, (47), 44 states have call successors, (47) [2022-11-25 22:47:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3359 transitions. [2022-11-25 22:47:06,181 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3359 transitions. Word has length 135 [2022-11-25 22:47:06,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:47:06,181 INFO L495 AbstractCegarLoop]: Abstraction has 2363 states and 3359 transitions. [2022-11-25 22:47:06,182 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-25 22:47:06,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3359 transitions. [2022-11-25 22:47:06,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-25 22:47:06,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:47:06,183 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-25 22:47:06,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:47:06,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-11-25 22:47:06,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-25 22:47:06,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:47:06,805 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:47:06,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:47:06,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2031259997, now seen corresponding path program 1 times [2022-11-25 22:47:06,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:47:06,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497728115] [2022-11-25 22:47:06,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:47:06,806 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-25 22:47:06,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:47:06,807 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:47:06,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:47:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:47:08,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 22:47:08,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:47:08,051 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-25 22:47:08,295 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:47:08,295 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-25 22:47:08,336 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-25 22:47:08,513 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-25 22:47:11,623 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:47:11,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:47:11,790 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:47:11,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:47:11,928 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:47:11,928 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-25 22:47:11,959 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-25 22:47:12,028 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-25 22:47:12,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:47:12,141 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-25 22:47:12,155 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-25 22:47:12,176 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-25 22:47:12,192 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-25 22:47:12,589 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-25 22:47:12,593 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:47:12,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497728115] [2022-11-25 22:47:12,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497728115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:47:12,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1856589122] [2022-11-25 22:47:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:47:12,594 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:47:12,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:47:12,595 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:47:12,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-11-25 22:47:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:47:23,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-25 22:47:23,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:47:23,400 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-25 22:47:23,604 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:47:23,605 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-25 22:47:23,625 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-25 22:47:23,713 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-25 22:47:26,701 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:47:26,702 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-25 22:47:26,800 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:47:26,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:47:26,871 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:47:26,871 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-25 22:47:26,899 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-25 22:47:26,911 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-25 22:47:26,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:47:26,934 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7768) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-25 22:47:26,951 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-25 22:47:26,974 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-25 22:47:26,993 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-25 22:47:27,404 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-25 22:47:27,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1856589122] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:47:27,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501742197] [2022-11-25 22:47:27,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:47:27,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:47:27,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:47:27,411 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:47:27,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-25 22:47:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:47:28,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-25 22:47:28,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:47:28,565 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:47:28,566 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-25 22:47:28,617 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-25 22:47:32,392 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:47:32,393 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-25 22:47:32,613 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:47:32,614 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-25 22:47:32,759 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:47:32,759 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-25 22:47:32,780 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-25 22:47:32,785 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-25 22:47:32,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:47:34,979 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2022-11-25 22:47:35,000 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-25 22:47:35,018 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-25 22:47:35,451 INFO L321 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2022-11-25 22:47:35,451 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-25 22:47:35,466 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-25 22:47:35,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501742197] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:47:35,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:47:35,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 28 [2022-11-25 22:47:35,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052662229] [2022-11-25 22:47:35,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:47:35,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 22:47:35,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:47:35,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 22:47:35,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=809, Unknown=44, NotChecked=994, Total=1980 [2022-11-25 22:47:35,471 INFO L87 Difference]: Start difference. First operand 2363 states and 3359 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-25 22:48:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:48:13,393 INFO L93 Difference]: Finished difference Result 3025 states and 4160 transitions. [2022-11-25 22:48:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 22:48:13,394 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-25 22:48:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:48:13,396 INFO L225 Difference]: With dead ends: 3025 [2022-11-25 22:48:13,396 INFO L226 Difference]: Without dead ends: 3025 [2022-11-25 22:48:13,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 269 SyntacticMatches, 131 SemanticMatches, 60 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1777 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=283, Invalid=1964, Unknown=65, NotChecked=1470, Total=3782 [2022-11-25 22:48:13,397 INFO L413 NwaCegarLoop]: 795 mSDtfsCounter, 1893 mSDsluCounter, 11168 mSDsCounter, 0 mSdLazyCounter, 11773 mSolverCounterSat, 55 mSolverCounterUnsat, 1175 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 11963 SdHoareTripleChecker+Invalid, 13003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 11773 IncrementalHoareTripleChecker+Invalid, 1175 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:48:13,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 11963 Invalid, 13003 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 11773 Invalid, 1175 Unknown, 0 Unchecked, 36.4s Time] [2022-11-25 22:48:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2022-11-25 22:48:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 2362. [2022-11-25 22:48:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 1796 states have (on average 1.8184855233853006) internal successors, (3266), 2309 states have internal predecessors, (3266), 44 states have call successors, (44), 19 states have call predecessors, (44), 19 states have return successors, (47), 36 states have call predecessors, (47), 44 states have call successors, (47) [2022-11-25 22:48:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3357 transitions. [2022-11-25 22:48:13,432 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3357 transitions. Word has length 138 [2022-11-25 22:48:13,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:48:13,432 INFO L495 AbstractCegarLoop]: Abstraction has 2362 states and 3357 transitions. [2022-11-25 22:48:13,432 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-25 22:48:13,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3357 transitions. [2022-11-25 22:48:13,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-25 22:48:13,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:48:13,433 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-25 22:48:13,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:48:13,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-25 22:48:13,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2022-11-25 22:48:14,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:48:14,043 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:48:14,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:48:14,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2031259998, now seen corresponding path program 1 times [2022-11-25 22:48:14,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:48:14,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761541938] [2022-11-25 22:48:14,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:48:14,045 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-25 22:48:14,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:48:14,047 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:48:14,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:48:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:48:15,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-25 22:48:15,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:48:15,427 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-25 22:48:15,871 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-25 22:48:15,928 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:48:15,929 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-25 22:48:15,981 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-25 22:48:15,997 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-25 22:48:16,181 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-25 22:48:16,189 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-25 22:48:19,203 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8813) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8814))) (exists ((v_arrayElimCell_107 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_107) (_ bv44 32)))) is different from true [2022-11-25 22:48:19,276 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:48:19,276 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-25 22:48:19,291 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-25 22:48:19,511 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:48:19,512 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-25 22:48:19,519 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-25 22:48:19,692 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:48:19,692 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-25 22:48:19,699 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-25 22:48:19,755 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-25 22:48:19,758 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-25 22:48:19,816 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-25 22:48:19,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:48:20,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_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-25 22:48:20,131 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-25 22:48:20,195 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-25 22:48:20,255 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-25 22:48:21,380 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_8910))) (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_8909) .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_8910))) (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_8909) .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 .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-25 22:48:21,401 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:48:21,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761541938] [2022-11-25 22:48:21,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761541938] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:48:21,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1969951211] [2022-11-25 22:48:21,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:48:21,402 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:48:21,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:48:21,404 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:48:21,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-11-25 22:48:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:48:27,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 125 conjunts are in the unsatisfiable core [2022-11-25 22:48:27,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:48:27,928 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-25 22:48:28,248 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-25 22:48:28,282 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:48:28,282 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-25 22:48:28,364 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-25 22:48:28,378 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-25 22:48:28,621 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-25 22:48:28,627 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-25 22:48:31,511 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_9409))) (exists ((v_ArrVal_9410 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_9410) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_107 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_107) (_ bv44 32)))) is different from true [2022-11-25 22:48:31,574 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:48:31,575 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-25 22:48:31,592 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-25 22:48:31,846 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:48:31,846 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-25 22:48:31,853 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-25 22:48:32,023 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:48:32,023 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-25 22:48:32,030 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-25 22:48:32,067 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-25 22:48:32,071 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-25 22:48:32,079 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-25 22:48:32,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:48:32,151 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-25 22:48:32,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_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-25 22:48:32,271 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-25 22:48:32,409 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))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9412) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 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))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9411))) (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_9412) .cse3 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-25 22:48:34,047 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_9506))) (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_9505) .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 .cse0 (_ bv12 32))))) (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_9506))) (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 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9505) .cse4 v_ArrVal_9412) .cse5 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (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-25 22:48:34,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1969951211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:48:34,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100572323] [2022-11-25 22:48:34,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:48:34,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:48:34,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:48:34,064 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:48:34,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-25 22:48:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:48:35,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-25 22:48:35,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:48:35,381 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-25 22:48:35,429 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:48:35,429 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-25 22:48:35,449 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-25 22:48:35,467 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-25 22:48:35,564 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-25 22:48:35,571 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-25 22:48:39,449 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10005) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_107 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_107) (_ bv44 32))) (exists ((v_ArrVal_10004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10004)))) is different from true [2022-11-25 22:48:39,545 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:48:39,545 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-25 22:48:39,559 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-25 22:48:39,754 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:48:39,754 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-25 22:48:39,774 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-25 22:48:39,862 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:48:39,862 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-25 22:48:39,872 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-25 22:48:39,919 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-25 22:48:39,923 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-25 22:48:39,935 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-25 22:48:39,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:48:40,026 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-25 22:48:40,066 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-25 22:48:40,216 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-25 22:48:40,342 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-25 22:48:42,056 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (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_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| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10101))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10006))) (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_10100) .cse0 v_ArrVal_10007) .cse1 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (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 ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10101))) (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_10100) .cse6 v_ArrVal_10007) (select (select (store .cse7 .cse6 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) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-25 22:48:42,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100572323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:48:42,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:48:42,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 25 [2022-11-25 22:48:42,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020948326] [2022-11-25 22:48:42,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:48:42,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 22:48:42,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:48:42,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 22:48:42,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=543, Unknown=19, NotChecked=1134, Total=1806 [2022-11-25 22:48:42,072 INFO L87 Difference]: Start difference. First operand 2362 states and 3357 transitions. Second operand has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 22:49:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:49:28,940 INFO L93 Difference]: Finished difference Result 3355 states and 4433 transitions. [2022-11-25 22:49:28,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 22:49:28,941 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 138 [2022-11-25 22:49:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:49:28,944 INFO L225 Difference]: With dead ends: 3355 [2022-11-25 22:49:28,944 INFO L226 Difference]: Without dead ends: 3355 [2022-11-25 22:49:28,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 268 SyntacticMatches, 134 SemanticMatches, 53 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=200, Invalid=1183, Unknown=21, NotChecked=1566, Total=2970 [2022-11-25 22:49:28,946 INFO L413 NwaCegarLoop]: 1096 mSDtfsCounter, 2113 mSDsluCounter, 7335 mSDsCounter, 0 mSdLazyCounter, 12904 mSolverCounterSat, 28 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2118 SdHoareTripleChecker+Valid, 8431 SdHoareTripleChecker+Invalid, 19783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 12904 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 6846 IncrementalHoareTripleChecker+Unchecked, 45.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:49:28,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2118 Valid, 8431 Invalid, 19783 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 12904 Invalid, 5 Unknown, 6846 Unchecked, 45.3s Time] [2022-11-25 22:49:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2022-11-25 22:49:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 2361. [2022-11-25 22:49:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 1796 states have (on average 1.8173719376391981) internal successors, (3264), 2308 states have internal predecessors, (3264), 44 states have call successors, (44), 19 states have call predecessors, (44), 19 states have return successors, (47), 36 states have call predecessors, (47), 44 states have call successors, (47) [2022-11-25 22:49:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3355 transitions. [2022-11-25 22:49:28,998 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3355 transitions. Word has length 138 [2022-11-25 22:49:28,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:49:28,999 INFO L495 AbstractCegarLoop]: Abstraction has 2361 states and 3355 transitions. [2022-11-25 22:49:28,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 22:49:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3355 transitions. [2022-11-25 22:49:29,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-25 22:49:29,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:49:29,000 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-25 22:49:29,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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)] Forceful destruction successful, exit code 0 [2022-11-25 22:49:29,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-11-25 22:49:29,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2022-11-25 22:49:29,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:49:29,623 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:49:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:49:29,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1472678910, now seen corresponding path program 1 times [2022-11-25 22:49:29,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:49:29,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534463433] [2022-11-25 22:49:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:49:29,625 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-25 22:49:29,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:49:29,626 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:49:29,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:49:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:49:31,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-25 22:49:31,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:49:31,117 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-25 22:49:31,540 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:49:31,541 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-25 22:49:31,614 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-25 22:49:31,852 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-25 22:49:35,989 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:35,990 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-25 22:49:36,224 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:36,225 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-25 22:49:36,434 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:36,435 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-25 22:49:36,640 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:36,640 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-25 22:49:36,680 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-25 22:49:36,784 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-25 22:49:36,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:49:36,960 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10573) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-25 22:49:36,980 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-11-25 22:49:37,011 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-25 22:49:37,034 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-25 22:49:37,069 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-25 22:49:37,098 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-25 22:49:37,647 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-25 22:49:37,652 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:49:37,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534463433] [2022-11-25 22:49:37,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534463433] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:49:37,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2098716447] [2022-11-25 22:49:37,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:49:37,653 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:49:37,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:49:37,654 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:49:37,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-25 22:49:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:49:46,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-25 22:49:46,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:49:46,155 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-25 22:49:46,526 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:49:46,526 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-25 22:49:46,557 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-25 22:49:46,661 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-25 22:49:50,818 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:50,819 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-25 22:49:50,973 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:50,974 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-25 22:49:51,091 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:51,091 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-25 22:49:51,209 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:51,209 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-25 22:49:51,248 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-25 22:49:51,266 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-25 22:49:51,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:49:53,457 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-25 22:49:53,487 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| 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)))))) is different from false [2022-11-25 22:49:53,511 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-25 22:49:53,546 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 (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_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-25 22:49:53,574 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-25 22:49:54,108 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-25 22:49:54,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2098716447] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:49:54,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663198918] [2022-11-25 22:49:54,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:49:54,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:49:54,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:49:54,120 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:49:54,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-25 22:49:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:49:55,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 22:49:55,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:49:55,630 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:49:55,631 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-25 22:49:55,716 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-25 22:50:01,238 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-25 22:50:01,289 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:01,289 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-25 22:50:01,468 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:01,469 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-25 22:50:01,655 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:01,655 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-25 22:50:01,856 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:01,856 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-25 22:50:02,032 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-25 22:50:02,040 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-25 22:50:02,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:50:02,086 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-25 22:50:02,086 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-25 22:50:02,099 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-25 22:50:02,115 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-25 22:50:02,141 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-25 22:50:02,161 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-25 22:50:02,195 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-25 22:50:02,217 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-25 22:50:02,778 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-25 22:50:02,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663198918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:50:02,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:50:02,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 29 [2022-11-25 22:50:02,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343890026] [2022-11-25 22:50:02,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:50:02,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 22:50:02,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:50:02,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 22:50:02,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=816, Unknown=51, NotChecked=1638, Total=2652 [2022-11-25 22:50:02,784 INFO L87 Difference]: Start difference. First operand 2361 states and 3355 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-25 22:50:55,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:50:55,405 INFO L93 Difference]: Finished difference Result 3023 states and 4156 transitions. [2022-11-25 22:50:55,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 22:50:55,406 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-25 22:50:55,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:50:55,410 INFO L225 Difference]: With dead ends: 3023 [2022-11-25 22:50:55,410 INFO L226 Difference]: Without dead ends: 3023 [2022-11-25 22:50:55,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 280 SyntacticMatches, 133 SemanticMatches, 66 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 1799 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=286, Invalid=1891, Unknown=69, NotChecked=2310, Total=4556 [2022-11-25 22:50:55,412 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 1881 mSDsluCounter, 11366 mSDsCounter, 0 mSdLazyCounter, 11532 mSolverCounterSat, 56 mSolverCounterUnsat, 1202 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 12160 SdHoareTripleChecker+Invalid, 14591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 11532 IncrementalHoareTripleChecker+Invalid, 1202 IncrementalHoareTripleChecker+Unknown, 1801 IncrementalHoareTripleChecker+Unchecked, 50.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:50:55,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 12160 Invalid, 14591 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [56 Valid, 11532 Invalid, 1202 Unknown, 1801 Unchecked, 50.6s Time] [2022-11-25 22:50:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2022-11-25 22:50:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 2360. [2022-11-25 22:50:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 1796 states have (on average 1.8162583518930957) internal successors, (3262), 2307 states have internal predecessors, (3262), 44 states have call successors, (44), 19 states have call predecessors, (44), 19 states have return successors, (47), 36 states have call predecessors, (47), 44 states have call successors, (47) [2022-11-25 22:50:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3353 transitions. [2022-11-25 22:50:55,447 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3353 transitions. Word has length 141 [2022-11-25 22:50:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:50:55,448 INFO L495 AbstractCegarLoop]: Abstraction has 2360 states and 3353 transitions. [2022-11-25 22:50:55,448 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-25 22:50:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3353 transitions. [2022-11-25 22:50:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-25 22:50:55,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:50:55,449 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-25 22:50:55,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-25 22:50:55,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2022-11-25 22:50:55,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:50:56,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:50:56,063 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-25 22:50:56,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:50:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1472678911, now seen corresponding path program 1 times [2022-11-25 22:50:56,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:50:56,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035975085] [2022-11-25 22:50:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:50:56,065 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-25 22:50:56,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:50:56,067 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:50:56,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3989193d-925e-455a-8be9-019930c2641f/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-25 22:50:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:50:57,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 129 conjunts are in the unsatisfiable core [2022-11-25 22:50:57,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:50:57,908 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