./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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 e4ea247b245ebcaf5e735452e89c4110c7b9dc9b43836e98484a894783fc3462 --- 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:41:47,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:41:47,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:41:47,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:41:47,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:41:47,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:41:47,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:41:47,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:41:47,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:41:47,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:41:47,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:41:47,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:41:47,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:41:47,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:41:47,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:41:47,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:41:47,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:41:47,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:41:47,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:41:47,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:41:47,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:41:47,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:41:47,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:41:47,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:41:47,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:41:47,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:41:47,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:41:47,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:41:47,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:41:47,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:41:47,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:41:47,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:41:47,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:41:47,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:41:47,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:41:47,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:41:47,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:41:47,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:41:47,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:41:47,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:41:47,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:41:47,588 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 22:41:47,614 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:41:47,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:41:47,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:41:47,615 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:41:47,616 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:41:47,616 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:41:47,616 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:41:47,617 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:41:47,617 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:41:47,617 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:41:47,618 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:41:47,618 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:41:47,618 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:41:47,619 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:41:47,619 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:41:47,619 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:41:47,619 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:41:47,620 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:41:47,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:41:47,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:41:47,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:41:47,621 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:41:47,621 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:41:47,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:41:47,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:41:47,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:41:47,622 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:41:47,623 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:41:47,623 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:41:47,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:41:47,623 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:41:47,624 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:41:47,624 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:41:47,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:41:47,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:41:47,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:41:47,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:41:47,625 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:41:47,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:41:47,626 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:41:47,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:41:47,626 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:41:47,626 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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 -> e4ea247b245ebcaf5e735452e89c4110c7b9dc9b43836e98484a894783fc3462 [2022-11-25 22:41:47,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:41:47,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:41:47,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:41:47,880 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:41:47,880 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:41:47,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i [2022-11-25 22:41:50,906 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:41:51,291 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:41:51,297 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i [2022-11-25 22:41:51,324 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/data/7691bddce/f5378ced736c4905afba785b15f82b52/FLAG2b99740ef [2022-11-25 22:41:51,340 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/data/7691bddce/f5378ced736c4905afba785b15f82b52 [2022-11-25 22:41:51,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:41:51,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:41:51,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:41:51,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:41:51,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:41:51,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:41:51" (1/1) ... [2022-11-25 22:41:51,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff524bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:41:51, skipping insertion in model container [2022-11-25 22:41:51,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:41:51" (1/1) ... [2022-11-25 22:41:51,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:41:51,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:41:52,094 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44118,44131] [2022-11-25 22:41:52,119 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44660,44673] [2022-11-25 22:41:52,123 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:41:52,275 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56247,56260] [2022-11-25 22:41:52,278 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56368,56381] [2022-11-25 22:41:52,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:41:52,307 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:41:52,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@37c731a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:41:52, skipping insertion in model container [2022-11-25 22:41:52,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:41:52,309 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 22:41:52,311 INFO L158 Benchmark]: Toolchain (without parser) took 965.72ms. Allocated memory is still 146.8MB. Free memory was 100.1MB in the beginning and 77.5MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 22:41:52,311 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 146.8MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:41:52,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 963.26ms. Allocated memory is still 146.8MB. Free memory was 99.7MB in the beginning and 77.5MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 22:41:52,319 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.21ms. Allocated memory is still 146.8MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 963.26ms. Allocated memory is still 146.8MB. Free memory was 99.7MB in the beginning and 77.5MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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 e4ea247b245ebcaf5e735452e89c4110c7b9dc9b43836e98484a894783fc3462 --- 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:41:54,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:41:54,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:41:54,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:41:54,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:41:54,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:41:54,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:41:54,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:41:54,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:41:54,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:41:54,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:41:54,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:41:54,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:41:54,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:41:54,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:41:54,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:41:54,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:41:54,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:41:54,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:41:54,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:41:54,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:41:54,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:41:54,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:41:54,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:41:54,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:41:54,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:41:54,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:41:54,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:41:54,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:41:54,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:41:54,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:41:54,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:41:54,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:41:54,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:41:54,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:41:54,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:41:54,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:41:54,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:41:54,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:41:54,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:41:54,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:41:54,751 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-25 22:41:54,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:41:54,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:41:54,793 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:41:54,793 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:41:54,794 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:41:54,794 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:41:54,794 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:41:54,794 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:41:54,795 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:41:54,795 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:41:54,796 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:41:54,796 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:41:54,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:41:54,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:41:54,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:41:54,798 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:41:54,798 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:41:54,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:41:54,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:41:54,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:41:54,799 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:41:54,799 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:41:54,799 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:41:54,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:41:54,800 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:41:54,800 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 22:41:54,800 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 22:41:54,800 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:41:54,800 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:41:54,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:41:54,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 22:41:54,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:41:54,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:41:54,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:41:54,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:41:54,802 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 22:41:54,802 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 22:41:54,803 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:41:54,803 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 22:41:54,803 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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 -> e4ea247b245ebcaf5e735452e89c4110c7b9dc9b43836e98484a894783fc3462 [2022-11-25 22:41:55,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:41:55,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:41:55,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:41:55,236 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:41:55,236 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:41:55,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i [2022-11-25 22:41:58,240 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:41:58,691 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:41:58,692 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i [2022-11-25 22:41:58,714 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/data/707ef553c/dcb3b5539d524d08907249c465725992/FLAGe55d5fd54 [2022-11-25 22:41:58,740 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/data/707ef553c/dcb3b5539d524d08907249c465725992 [2022-11-25 22:41:58,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:41:58,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:41:58,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:41:58,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:41:58,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:41:58,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:41:58" (1/1) ... [2022-11-25 22:41:58,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26f634eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:41:58, skipping insertion in model container [2022-11-25 22:41:58,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:41:58" (1/1) ... [2022-11-25 22:41:58,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:41:58,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:41:59,441 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44118,44131] [2022-11-25 22:41:59,454 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44660,44673] [2022-11-25 22:41:59,456 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:41:59,603 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56247,56260] [2022-11-25 22:41:59,609 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56368,56381] [2022-11-25 22:41:59,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:41:59,665 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 22:41:59,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:41:59,720 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44118,44131] [2022-11-25 22:41:59,722 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44660,44673] [2022-11-25 22:41:59,723 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:41:59,810 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56247,56260] [2022-11-25 22:41:59,816 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56368,56381] [2022-11-25 22:41:59,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:41:59,886 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:41:59,945 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44118,44131] [2022-11-25 22:41:59,946 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44660,44673] [2022-11-25 22:41:59,947 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 22:42:00,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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56247,56260] [2022-11-25 22:42:00,018 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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56368,56381] [2022-11-25 22:42:00,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:42:00,114 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:42:00,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:00 WrapperNode [2022-11-25 22:42:00,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:42:00,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:42:00,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:42:00,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:42:00,126 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:42:00" (1/1) ... [2022-11-25 22:42:00,184 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:42:00" (1/1) ... [2022-11-25 22:42:00,261 INFO L138 Inliner]: procedures = 285, calls = 347, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1200 [2022-11-25 22:42:00,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:42:00,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:42:00,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:42:00,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:42:00,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:00" (1/1) ... [2022-11-25 22:42:00,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:00" (1/1) ... [2022-11-25 22:42:00,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:00" (1/1) ... [2022-11-25 22:42:00,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:00" (1/1) ... [2022-11-25 22:42:00,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:00" (1/1) ... [2022-11-25 22:42:00,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:00" (1/1) ... [2022-11-25 22:42:00,349 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:00" (1/1) ... [2022-11-25 22:42:00,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:00" (1/1) ... [2022-11-25 22:42:00,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:42:00,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:42:00,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:42:00,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:42:00,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:00" (1/1) ... [2022-11-25 22:42:00,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:42:00,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:42:00,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:42:00,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:42:00,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 22:42:00,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 22:42:00,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:42:00,463 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-25 22:42:00,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 22:42:00,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:42:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 22:42:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 22:42:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2022-11-25 22:42:00,464 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2022-11-25 22:42:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 22:42:00,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 22:42:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 22:42:00,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:42:00,465 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2022-11-25 22:42:00,465 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2022-11-25 22:42:00,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 22:42:00,465 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2022-11-25 22:42:00,465 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2022-11-25 22:42:00,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:42:00,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:42:00,729 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:42:00,731 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:42:06,156 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:42:06,174 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:42:06,178 INFO L300 CfgBuilder]: Removed 72 assume(true) statements. [2022-11-25 22:42:06,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:42:06 BoogieIcfgContainer [2022-11-25 22:42:06,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:42:06,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:42:06,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:42:06,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:42:06,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:41:58" (1/3) ... [2022-11-25 22:42:06,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4a05ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:42:06, skipping insertion in model container [2022-11-25 22:42:06,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:00" (2/3) ... [2022-11-25 22:42:06,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4a05ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:42:06, skipping insertion in model container [2022-11-25 22:42:06,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:42:06" (3/3) ... [2022-11-25 22:42:06,196 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-2.i [2022-11-25 22:42:06,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:42:06,215 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 634 error locations. [2022-11-25 22:42:06,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:42:06,324 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;@31fe19e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:42:06,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 634 error locations. [2022-11-25 22:42:06,335 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:42:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 22:42:06,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:06,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 22:42:06,342 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:42:06,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:06,350 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2022-11-25 22:42:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:06,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375410880] [2022-11-25 22:42:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:06,363 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:42:06,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:06,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:06,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:06,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:42:06,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:06,695 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:42:06,725 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:42:06,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:06,726 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:06,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375410880] [2022-11-25 22:42:06,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375410880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:06,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:06,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:42:06,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372029512] [2022-11-25 22:42:06,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:06,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:42:06,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:06,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:42:06,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:42:06,811 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:42:09,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:09,518 INFO L93 Difference]: Finished difference Result 1536 states and 1625 transitions. [2022-11-25 22:42:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:42:09,521 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:42:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:09,544 INFO L225 Difference]: With dead ends: 1536 [2022-11-25 22:42:09,545 INFO L226 Difference]: Without dead ends: 1534 [2022-11-25 22:42:09,546 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:42:09,549 INFO L413 NwaCegarLoop]: 909 mSDtfsCounter, 906 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:09,552 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.6s Time] [2022-11-25 22:42:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2022-11-25 22:42:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1299. [2022-11-25 22:42:09,701 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:42:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1418 transitions. [2022-11-25 22:42:09,713 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1418 transitions. Word has length 3 [2022-11-25 22:42:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:09,713 INFO L495 AbstractCegarLoop]: Abstraction has 1299 states and 1418 transitions. [2022-11-25 22:42:09,715 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:42:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1418 transitions. [2022-11-25 22:42:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 22:42:09,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:09,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 22:42:09,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:09,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:09,932 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:42:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:09,933 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2022-11-25 22:42:09,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:09,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79484070] [2022-11-25 22:42:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:09,934 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:42:09,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:09,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:09,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:10,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:42:10,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:10,101 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:42:10,113 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:42:10,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:10,114 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:10,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79484070] [2022-11-25 22:42:10,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79484070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:10,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:10,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:42:10,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401918551] [2022-11-25 22:42:10,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:10,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:42:10,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:10,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:42:10,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:42:10,118 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:42:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:14,393 INFO L93 Difference]: Finished difference Result 1890 states and 2056 transitions. [2022-11-25 22:42:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:42:14,393 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:42:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:14,400 INFO L225 Difference]: With dead ends: 1890 [2022-11-25 22:42:14,400 INFO L226 Difference]: Without dead ends: 1890 [2022-11-25 22:42:14,400 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:42:14,402 INFO L413 NwaCegarLoop]: 1053 mSDtfsCounter, 624 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:14,402 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.2s Time] [2022-11-25 22:42:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2022-11-25 22:42:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1503. [2022-11-25 22:42:14,434 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:42:14,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1834 transitions. [2022-11-25 22:42:14,440 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1834 transitions. Word has length 3 [2022-11-25 22:42:14,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:14,441 INFO L495 AbstractCegarLoop]: Abstraction has 1503 states and 1834 transitions. [2022-11-25 22:42:14,441 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:42:14,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1834 transitions. [2022-11-25 22:42:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:42:14,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:14,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:14,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:14,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:14,653 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:42:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:14,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2022-11-25 22:42:14,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:14,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766441742] [2022-11-25 22:42:14,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:14,655 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:42:14,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:14,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:14,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:14,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:42:14,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:14,864 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:42:14,870 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:42:14,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:14,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:42:14,990 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:42:14,990 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:42:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:15,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:15,018 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:15,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766441742] [2022-11-25 22:42:15,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766441742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:15,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:15,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:42:15,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547427476] [2022-11-25 22:42:15,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:15,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:42:15,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:15,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:42:15,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:42:15,021 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:42:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:22,207 INFO L93 Difference]: Finished difference Result 2568 states and 2977 transitions. [2022-11-25 22:42:22,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:42:22,208 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:42:22,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:22,217 INFO L225 Difference]: With dead ends: 2568 [2022-11-25 22:42:22,217 INFO L226 Difference]: Without dead ends: 2568 [2022-11-25 22:42:22,218 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:42:22,219 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 1109 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 2206 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:22,220 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.1s Time] [2022-11-25 22:42:22,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-11-25 22:42:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 1648. [2022-11-25 22:42:22,256 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:42:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2117 transitions. [2022-11-25 22:42:22,261 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2117 transitions. Word has length 8 [2022-11-25 22:42:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:22,262 INFO L495 AbstractCegarLoop]: Abstraction has 1648 states and 2117 transitions. [2022-11-25 22:42:22,262 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:42:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2117 transitions. [2022-11-25 22:42:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 22:42:22,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:22,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:22,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:22,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:22,479 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:42:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:22,479 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2022-11-25 22:42:22,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:22,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542649890] [2022-11-25 22:42:22,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:22,480 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:42:22,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:22,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:22,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:22,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:42:22,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:22,650 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:42:22,679 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:42:22,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:22,680 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:22,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542649890] [2022-11-25 22:42:22,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542649890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:22,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:22,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:42:22,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035934451] [2022-11-25 22:42:22,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:22,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:42:22,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:22,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:42:22,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:42:22,686 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:42:27,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:27,197 INFO L93 Difference]: Finished difference Result 2810 states and 3510 transitions. [2022-11-25 22:42:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:42:27,199 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:42:27,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:27,208 INFO L225 Difference]: With dead ends: 2810 [2022-11-25 22:42:27,208 INFO L226 Difference]: Without dead ends: 2810 [2022-11-25 22:42:27,208 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:42:27,209 INFO L413 NwaCegarLoop]: 1319 mSDtfsCounter, 2331 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:27,210 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.4s Time] [2022-11-25 22:42:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2022-11-25 22:42:27,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 1603. [2022-11-25 22:42:27,245 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:42:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2058 transitions. [2022-11-25 22:42:27,250 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2058 transitions. Word has length 9 [2022-11-25 22:42:27,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:27,251 INFO L495 AbstractCegarLoop]: Abstraction has 1603 states and 2058 transitions. [2022-11-25 22:42:27,251 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:42:27,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2058 transitions. [2022-11-25 22:42:27,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 22:42:27,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:27,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:27,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:27,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:27,464 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:42:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2022-11-25 22:42:27,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:27,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092499015] [2022-11-25 22:42:27,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:27,465 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:42:27,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:27,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:27,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:27,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:42:27,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:27,658 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:42:27,702 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:42:27,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:27,703 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:27,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092499015] [2022-11-25 22:42:27,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092499015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:27,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:27,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:42:27,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219878973] [2022-11-25 22:42:27,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:27,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:42:27,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:27,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:42:27,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:42:27,720 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:42:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:33,178 INFO L93 Difference]: Finished difference Result 2439 states and 3103 transitions. [2022-11-25 22:42:33,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:42:33,178 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:42:33,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:33,186 INFO L225 Difference]: With dead ends: 2439 [2022-11-25 22:42:33,187 INFO L226 Difference]: Without dead ends: 2439 [2022-11-25 22:42:33,187 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:42:33,188 INFO L413 NwaCegarLoop]: 1511 mSDtfsCounter, 1581 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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:42:33,188 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:42:33,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2022-11-25 22:42:33,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 1593. [2022-11-25 22:42:33,219 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:42:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2034 transitions. [2022-11-25 22:42:33,225 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2034 transitions. Word has length 9 [2022-11-25 22:42:33,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:33,225 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 2034 transitions. [2022-11-25 22:42:33,225 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:42:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2034 transitions. [2022-11-25 22:42:33,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:42:33,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:33,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:33,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:33,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:33,444 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:42:33,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:33,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1033799265, now seen corresponding path program 1 times [2022-11-25 22:42:33,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:33,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883499936] [2022-11-25 22:42:33,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:33,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:42:33,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:33,447 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:33,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:33,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:42:33,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:33,702 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:42:33,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:33,703 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:33,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883499936] [2022-11-25 22:42:33,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883499936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:33,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:33,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:42:33,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37205832] [2022-11-25 22:42:33,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:33,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:42:33,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:33,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:42:33,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:42:33,705 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:42:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:34,715 INFO L93 Difference]: Finished difference Result 2263 states and 2807 transitions. [2022-11-25 22:42:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:42:34,716 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:42:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:34,723 INFO L225 Difference]: With dead ends: 2263 [2022-11-25 22:42:34,723 INFO L226 Difference]: Without dead ends: 2263 [2022-11-25 22:42:34,723 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:42:34,729 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:42:34,730 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:42:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2022-11-25 22:42:34,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1851. [2022-11-25 22:42:34,760 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:42:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2552 transitions. [2022-11-25 22:42:34,767 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2552 transitions. Word has length 11 [2022-11-25 22:42:34,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:34,767 INFO L495 AbstractCegarLoop]: Abstraction has 1851 states and 2552 transitions. [2022-11-25 22:42:34,767 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:42:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2552 transitions. [2022-11-25 22:42:34,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 22:42:34,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:34,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:34,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:34,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:34,980 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:42:34,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:34,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1306900600, now seen corresponding path program 1 times [2022-11-25 22:42:34,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:34,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774262108] [2022-11-25 22:42:34,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:34,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:42:34,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:34,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:34,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:35,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:42:35,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:35,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:35,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:35,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:35,222 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:42:35,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:42:35,283 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:42:35,302 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:42:35,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:35,302 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:35,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774262108] [2022-11-25 22:42:35,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774262108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:35,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:35,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:42:35,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697021945] [2022-11-25 22:42:35,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:35,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:42:35,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:35,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:42:35,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:42:35,305 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:42:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:37,234 INFO L93 Difference]: Finished difference Result 1999 states and 2407 transitions. [2022-11-25 22:42:37,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:42:37,236 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:42:37,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:37,243 INFO L225 Difference]: With dead ends: 1999 [2022-11-25 22:42:37,243 INFO L226 Difference]: Without dead ends: 1999 [2022-11-25 22:42:37,243 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:42:37,244 INFO L413 NwaCegarLoop]: 1384 mSDtfsCounter, 502 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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:42:37,245 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:42:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2022-11-25 22:42:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1493. [2022-11-25 22:42:37,268 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:42:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1826 transitions. [2022-11-25 22:42:37,272 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1826 transitions. Word has length 14 [2022-11-25 22:42:37,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:37,273 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 1826 transitions. [2022-11-25 22:42:37,273 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:42:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1826 transitions. [2022-11-25 22:42:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 22:42:37,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:37,274 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:42:37,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:37,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:37,488 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:42:37,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2022-11-25 22:42:37,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:37,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434596275] [2022-11-25 22:42:37,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:37,489 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:42:37,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:37,490 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:37,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:37,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 22:42:37,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:37,724 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:42:37,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:37,724 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:37,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434596275] [2022-11-25 22:42:37,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434596275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:37,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:37,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:42:37,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896420075] [2022-11-25 22:42:37,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:37,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:42:37,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:37,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:42:37,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:42:37,727 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:42:37,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:37,770 INFO L93 Difference]: Finished difference Result 1433 states and 1740 transitions. [2022-11-25 22:42:37,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:42:37,770 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:42:37,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:37,775 INFO L225 Difference]: With dead ends: 1433 [2022-11-25 22:42:37,775 INFO L226 Difference]: Without dead ends: 1433 [2022-11-25 22:42:37,775 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:42:37,776 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:42:37,777 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:42:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2022-11-25 22:42:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2022-11-25 22:42:37,795 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:42:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1740 transitions. [2022-11-25 22:42:37,799 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1740 transitions. Word has length 19 [2022-11-25 22:42:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:37,800 INFO L495 AbstractCegarLoop]: Abstraction has 1433 states and 1740 transitions. [2022-11-25 22:42:37,800 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:42:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1740 transitions. [2022-11-25 22:42:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 22:42:37,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:37,801 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:42:37,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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)] Ended with exit code 0 [2022-11-25 22:42:38,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:38,014 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:42:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:38,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2022-11-25 22:42:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:38,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285185122] [2022-11-25 22:42:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:38,015 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:42:38,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:38,016 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:38,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:38,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:42:38,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:38,259 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:42:38,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:38,259 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:38,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285185122] [2022-11-25 22:42:38,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285185122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:38,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:38,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:42:38,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819060654] [2022-11-25 22:42:38,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:38,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:42:38,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:38,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:42:38,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:42:38,263 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:42:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:38,353 INFO L93 Difference]: Finished difference Result 1405 states and 1684 transitions. [2022-11-25 22:42:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:42:38,354 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:42:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:38,360 INFO L225 Difference]: With dead ends: 1405 [2022-11-25 22:42:38,360 INFO L226 Difference]: Without dead ends: 1405 [2022-11-25 22:42:38,361 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:42:38,363 INFO L413 NwaCegarLoop]: 1192 mSDtfsCounter, 1144 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:42:38,364 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:42:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2022-11-25 22:42:38,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1403. [2022-11-25 22:42:38,382 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:42:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1682 transitions. [2022-11-25 22:42:38,386 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 1682 transitions. Word has length 21 [2022-11-25 22:42:38,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:38,386 INFO L495 AbstractCegarLoop]: Abstraction has 1403 states and 1682 transitions. [2022-11-25 22:42:38,386 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:42:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1682 transitions. [2022-11-25 22:42:38,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 22:42:38,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:38,387 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:42:38,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:38,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:38,599 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:42:38,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:38,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2022-11-25 22:42:38,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:38,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250071713] [2022-11-25 22:42:38,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:38,606 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:42:38,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:38,607 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:38,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:38,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:42:38,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:38,859 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:42:38,964 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:42:38,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:38,964 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:38,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250071713] [2022-11-25 22:42:38,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250071713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:38,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:38,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:42:38,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964870843] [2022-11-25 22:42:38,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:38,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:42:38,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:38,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:42:38,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:42:38,967 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:42:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:44,126 INFO L93 Difference]: Finished difference Result 2571 states and 3078 transitions. [2022-11-25 22:42:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:42:44,128 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:42:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:44,135 INFO L225 Difference]: With dead ends: 2571 [2022-11-25 22:42:44,135 INFO L226 Difference]: Without dead ends: 2571 [2022-11-25 22:42:44,136 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:42:44,136 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.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:44,136 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.0s Time] [2022-11-25 22:42:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-11-25 22:42:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 1399. [2022-11-25 22:42:44,159 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:42:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1674 transitions. [2022-11-25 22:42:44,162 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1674 transitions. Word has length 35 [2022-11-25 22:42:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:44,163 INFO L495 AbstractCegarLoop]: Abstraction has 1399 states and 1674 transitions. [2022-11-25 22:42:44,163 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:42:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1674 transitions. [2022-11-25 22:42:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 22:42:44,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:44,164 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:42:44,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:44,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:44,376 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:42:44,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:44,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2022-11-25 22:42:44,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:44,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516546198] [2022-11-25 22:42:44,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:44,378 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:42:44,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:44,379 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:44,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:44,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 22:42:44,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:44,667 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:42:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:44,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:44,901 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:44,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516546198] [2022-11-25 22:42:44,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516546198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:44,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:44,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:42:44,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28018661] [2022-11-25 22:42:44,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:44,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:42:44,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:44,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:42:44,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:42:44,903 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:42:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:51,095 INFO L93 Difference]: Finished difference Result 2213 states and 2657 transitions. [2022-11-25 22:42:51,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:42:51,095 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:42:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:51,102 INFO L225 Difference]: With dead ends: 2213 [2022-11-25 22:42:51,102 INFO L226 Difference]: Without dead ends: 2213 [2022-11-25 22:42:51,102 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:42:51,103 INFO L413 NwaCegarLoop]: 1538 mSDtfsCounter, 2195 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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:42:51,103 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:42:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2022-11-25 22:42:51,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 1395. [2022-11-25 22:42:51,125 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:42:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1666 transitions. [2022-11-25 22:42:51,129 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1666 transitions. Word has length 35 [2022-11-25 22:42:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:51,129 INFO L495 AbstractCegarLoop]: Abstraction has 1395 states and 1666 transitions. [2022-11-25 22:42:51,129 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:42:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1666 transitions. [2022-11-25 22:42:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 22:42:51,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:51,131 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:42:51,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:51,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:51,343 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:42:51,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2063651411, now seen corresponding path program 1 times [2022-11-25 22:42:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:51,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562539174] [2022-11-25 22:42:51,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:51,345 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:42:51,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:51,346 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:51,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:51,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:42:51,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:51,706 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:42:51,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:51,706 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:51,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562539174] [2022-11-25 22:42:51,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562539174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:51,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:51,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:42:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637445087] [2022-11-25 22:42:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:51,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:42:51,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:42:51,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:42:51,709 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:42:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:51,777 INFO L93 Difference]: Finished difference Result 1383 states and 1646 transitions. [2022-11-25 22:42:51,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:42:51,777 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:42:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:51,782 INFO L225 Difference]: With dead ends: 1383 [2022-11-25 22:42:51,782 INFO L226 Difference]: Without dead ends: 1383 [2022-11-25 22:42:51,782 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:42:51,783 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:42:51,783 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:42:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2022-11-25 22:42:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2022-11-25 22:42:51,801 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:42:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1646 transitions. [2022-11-25 22:42:51,804 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1646 transitions. Word has length 54 [2022-11-25 22:42:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:51,805 INFO L495 AbstractCegarLoop]: Abstraction has 1383 states and 1646 transitions. [2022-11-25 22:42:51,805 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:42:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1646 transitions. [2022-11-25 22:42:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 22:42:51,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:51,807 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:42:51,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:52,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:52,028 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:42:52,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:52,028 INFO L85 PathProgramCache]: Analyzing trace with hash -202865055, now seen corresponding path program 1 times [2022-11-25 22:42:52,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:52,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571110012] [2022-11-25 22:42:52,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:52,029 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:42:52,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:52,032 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:52,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:52,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 22:42:52,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:52,506 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 22:42:52,506 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:42:52,584 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 22:42:52,584 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:42:53,041 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:42:53,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:53,041 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:53,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571110012] [2022-11-25 22:42:53,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571110012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:53,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:53,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:42:53,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225256392] [2022-11-25 22:42:53,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:53,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:42:53,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:53,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:42:53,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:42:53,044 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:42:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:58,102 INFO L93 Difference]: Finished difference Result 3211 states and 3774 transitions. [2022-11-25 22:42:58,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:42:58,104 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:42:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:58,112 INFO L225 Difference]: With dead ends: 3211 [2022-11-25 22:42:58,112 INFO L226 Difference]: Without dead ends: 3211 [2022-11-25 22:42:58,113 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:42:58,113 INFO L413 NwaCegarLoop]: 1188 mSDtfsCounter, 3186 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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, 4.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:58,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3186 Valid, 2330 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-25 22:42:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3211 states. [2022-11-25 22:42:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3211 to 1837. [2022-11-25 22:42:58,147 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:42:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2492 transitions. [2022-11-25 22:42:58,152 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2492 transitions. Word has length 62 [2022-11-25 22:42:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:58,154 INFO L495 AbstractCegarLoop]: Abstraction has 1837 states and 2492 transitions. [2022-11-25 22:42:58,154 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:42:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2492 transitions. [2022-11-25 22:42:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 22:42:58,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:58,157 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:42:58,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:58,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:58,372 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:42:58,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:58,372 INFO L85 PathProgramCache]: Analyzing trace with hash -202865054, now seen corresponding path program 1 times [2022-11-25 22:42:58,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:58,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466284628] [2022-11-25 22:42:58,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:58,373 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:42:58,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:58,374 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:58,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:42:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:58,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 22:42:58,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:58,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:58,875 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:42:58,963 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:42:58,963 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:42:59,652 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:42:59,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:59,652 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:59,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466284628] [2022-11-25 22:42:59,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466284628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:59,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:59,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:42:59,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375220590] [2022-11-25 22:42:59,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:59,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:42:59,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:59,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:42:59,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:42:59,654 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:43:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:03,569 INFO L93 Difference]: Finished difference Result 1843 states and 2499 transitions. [2022-11-25 22:43:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:43:03,570 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:43:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:03,575 INFO L225 Difference]: With dead ends: 1843 [2022-11-25 22:43:03,575 INFO L226 Difference]: Without dead ends: 1843 [2022-11-25 22:43:03,575 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:43:03,576 INFO L413 NwaCegarLoop]: 1168 mSDtfsCounter, 111 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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, 3.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:03,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2396 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-25 22:43:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2022-11-25 22:43:03,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1842. [2022-11-25 22:43:03,622 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:43:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2498 transitions. [2022-11-25 22:43:03,626 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2498 transitions. Word has length 62 [2022-11-25 22:43:03,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:03,628 INFO L495 AbstractCegarLoop]: Abstraction has 1842 states and 2498 transitions. [2022-11-25 22:43:03,628 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:43:03,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2498 transitions. [2022-11-25 22:43:03,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 22:43:03,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:03,631 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:43:03,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:03,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:03,851 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:43:03,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:03,852 INFO L85 PathProgramCache]: Analyzing trace with hash -904346310, now seen corresponding path program 1 times [2022-11-25 22:43:03,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:03,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500623640] [2022-11-25 22:43:03,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:03,853 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:43:03,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:03,854 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:03,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:04,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:43:04,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:04,260 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:43:04,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:04,260 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:04,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500623640] [2022-11-25 22:43:04,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500623640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:04,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:04,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:43:04,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352389613] [2022-11-25 22:43:04,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:04,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:43:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:43:04,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:43:04,262 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:43:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:04,389 INFO L93 Difference]: Finished difference Result 1868 states and 2525 transitions. [2022-11-25 22:43:04,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:43:04,390 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:43:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:04,395 INFO L225 Difference]: With dead ends: 1868 [2022-11-25 22:43:04,395 INFO L226 Difference]: Without dead ends: 1868 [2022-11-25 22:43:04,396 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:43:04,396 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:43:04,396 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:43:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2022-11-25 22:43:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1866. [2022-11-25 22:43:04,428 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:43:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2525 transitions. [2022-11-25 22:43:04,432 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2525 transitions. Word has length 68 [2022-11-25 22:43:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:04,432 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 2525 transitions. [2022-11-25 22:43:04,432 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:43:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2525 transitions. [2022-11-25 22:43:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 22:43:04,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:04,434 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:43:04,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:04,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:04,648 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:43:04,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:04,649 INFO L85 PathProgramCache]: Analyzing trace with hash -961994179, now seen corresponding path program 1 times [2022-11-25 22:43:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:04,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102127484] [2022-11-25 22:43:04,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:04,650 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:43:04,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:04,651 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:04,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:04,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:43:04,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:05,169 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:43:05,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:05,169 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:05,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102127484] [2022-11-25 22:43:05,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102127484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:05,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:05,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:43:05,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681412874] [2022-11-25 22:43:05,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:05,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:43:05,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:05,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:43:05,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:43:05,171 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:43:05,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:05,414 INFO L93 Difference]: Finished difference Result 1878 states and 2539 transitions. [2022-11-25 22:43:05,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:43:05,415 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:43:05,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:05,420 INFO L225 Difference]: With dead ends: 1878 [2022-11-25 22:43:05,420 INFO L226 Difference]: Without dead ends: 1878 [2022-11-25 22:43:05,421 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:43:05,421 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:43:05,422 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:43:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-11-25 22:43:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1869. [2022-11-25 22:43:05,450 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:43:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2528 transitions. [2022-11-25 22:43:05,454 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2528 transitions. Word has length 68 [2022-11-25 22:43:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:05,455 INFO L495 AbstractCegarLoop]: Abstraction has 1869 states and 2528 transitions. [2022-11-25 22:43:05,455 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:43:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2528 transitions. [2022-11-25 22:43:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 22:43:05,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:05,456 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:43:05,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:05,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:05,671 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:43:05,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1684223946, now seen corresponding path program 1 times [2022-11-25 22:43:05,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:05,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296594568] [2022-11-25 22:43:05,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:05,672 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:43:05,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:05,674 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:05,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:06,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:43:06,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:06,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:43:06,310 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:43:06,331 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 22:43:06,332 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:43:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:43:06,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:06,344 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:06,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296594568] [2022-11-25 22:43:06,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296594568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:06,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:06,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:43:06,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407138479] [2022-11-25 22:43:06,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:06,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:43:06,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:06,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:43:06,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2022-11-25 22:43:06,346 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:43:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:12,077 INFO L93 Difference]: Finished difference Result 3193 states and 4238 transitions. [2022-11-25 22:43:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:43:12,084 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:43:12,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:12,091 INFO L225 Difference]: With dead ends: 3193 [2022-11-25 22:43:12,091 INFO L226 Difference]: Without dead ends: 3193 [2022-11-25 22:43:12,091 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:43:12,092 INFO L413 NwaCegarLoop]: 1101 mSDtfsCounter, 1620 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 2738 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s 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.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:12,092 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.6s Time] [2022-11-25 22:43:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2022-11-25 22:43:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 1868. [2022-11-25 22:43:12,146 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:43:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2526 transitions. [2022-11-25 22:43:12,152 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2526 transitions. Word has length 73 [2022-11-25 22:43:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:12,152 INFO L495 AbstractCegarLoop]: Abstraction has 1868 states and 2526 transitions. [2022-11-25 22:43:12,153 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:43:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2526 transitions. [2022-11-25 22:43:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 22:43:12,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:12,154 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:43:12,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:12,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:12,377 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:43:12,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1684223945, now seen corresponding path program 1 times [2022-11-25 22:43:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:12,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422503677] [2022-11-25 22:43:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:12,378 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:43:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:12,380 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:12,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:12,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 22:43:12,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:12,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 7 [2022-11-25 22:43:12,842 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:43:13,401 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:43:13,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:13,428 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:43:13,443 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:43:13,443 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:43:13,464 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:43:13,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:13,464 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:13,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422503677] [2022-11-25 22:43:13,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422503677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:13,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:13,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:43:13,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572370432] [2022-11-25 22:43:13,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:13,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:43:13,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:13,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:43:13,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2022-11-25 22:43:13,466 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:43:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:22,806 INFO L93 Difference]: Finished difference Result 3264 states and 4363 transitions. [2022-11-25 22:43:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:43:22,807 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:43:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:22,812 INFO L225 Difference]: With dead ends: 3264 [2022-11-25 22:43:22,812 INFO L226 Difference]: Without dead ends: 3264 [2022-11-25 22:43:22,813 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:43:22,813 INFO L413 NwaCegarLoop]: 1299 mSDtfsCounter, 2343 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s 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.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:22,813 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.2s Time] [2022-11-25 22:43:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2022-11-25 22:43:22,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 1864. [2022-11-25 22:43:22,843 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:43:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2514 transitions. [2022-11-25 22:43:22,862 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2514 transitions. Word has length 73 [2022-11-25 22:43:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:22,862 INFO L495 AbstractCegarLoop]: Abstraction has 1864 states and 2514 transitions. [2022-11-25 22:43:22,863 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:43:22,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2514 transitions. [2022-11-25 22:43:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-25 22:43:22,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:22,864 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:43:22,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:23,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:23,079 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:43:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1696557543, now seen corresponding path program 1 times [2022-11-25 22:43:23,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:23,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755752544] [2022-11-25 22:43:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:23,081 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:43:23,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:23,082 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:23,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:23,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 22:43:23,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:23,488 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:43:23,512 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:43:23,546 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:43:23,588 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:43:23,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:23,588 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:23,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755752544] [2022-11-25 22:43:23,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755752544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:23,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:23,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 22:43:23,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626177298] [2022-11-25 22:43:23,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:23,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:43:23,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:23,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:43:23,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:43:23,591 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:43:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:29,198 INFO L93 Difference]: Finished difference Result 1879 states and 2530 transitions. [2022-11-25 22:43:29,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 22:43:29,198 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:43:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:29,200 INFO L225 Difference]: With dead ends: 1879 [2022-11-25 22:43:29,200 INFO L226 Difference]: Without dead ends: 1879 [2022-11-25 22:43:29,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:43:29,201 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 23 mSDsluCounter, 3748 mSDsCounter, 0 mSdLazyCounter, 3317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:29,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.5s Time] [2022-11-25 22:43:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2022-11-25 22:43:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1878. [2022-11-25 22:43:29,224 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:43:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2530 transitions. [2022-11-25 22:43:29,228 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2530 transitions. Word has length 80 [2022-11-25 22:43:29,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:29,229 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2530 transitions. [2022-11-25 22:43:29,229 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:43:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2530 transitions. [2022-11-25 22:43:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 22:43:29,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:29,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:29,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:29,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:29,445 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:43:29,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:29,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1053676349, now seen corresponding path program 1 times [2022-11-25 22:43:29,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:29,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040155308] [2022-11-25 22:43:29,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:29,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:43:29,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:29,447 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:29,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:29,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 22:43:29,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:29,861 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:43:29,903 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:43:29,911 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:43:29,980 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:43:29,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 19 treesize of output 7 [2022-11-25 22:43:30,078 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:43:30,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:30,079 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:30,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040155308] [2022-11-25 22:43:30,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040155308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:30,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:30,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 22:43:30,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892834743] [2022-11-25 22:43:30,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:30,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 22:43:30,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:30,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 22:43:30,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:43:30,082 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:43:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:37,596 INFO L93 Difference]: Finished difference Result 1878 states and 2528 transitions. [2022-11-25 22:43:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 22:43:37,597 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:43:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:37,614 INFO L225 Difference]: With dead ends: 1878 [2022-11-25 22:43:37,614 INFO L226 Difference]: Without dead ends: 1878 [2022-11-25 22:43:37,614 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:43:37,615 INFO L413 NwaCegarLoop]: 1164 mSDtfsCounter, 19 mSDsluCounter, 4769 mSDsCounter, 0 mSdLazyCounter, 3477 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s 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, 7.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:37,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 5933 Invalid, 3478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3477 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-11-25 22:43:37,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-11-25 22:43:37,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1878. [2022-11-25 22:43:37,638 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:43:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2528 transitions. [2022-11-25 22:43:37,641 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2528 transitions. Word has length 81 [2022-11-25 22:43:37,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:37,642 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2528 transitions. [2022-11-25 22:43:37,642 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:43:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2528 transitions. [2022-11-25 22:43:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-25 22:43:37,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:37,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:37,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-11-25 22:43:37,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:37,858 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:43:37,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:37,858 INFO L85 PathProgramCache]: Analyzing trace with hash 491350102, now seen corresponding path program 1 times [2022-11-25 22:43:37,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:37,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473861269] [2022-11-25 22:43:37,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:37,859 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:43:37,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:37,860 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:37,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:38,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:43:38,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:38,348 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:43:38,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:43:38,348 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:38,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473861269] [2022-11-25 22:43:38,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473861269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:38,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:38,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:43:38,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959607316] [2022-11-25 22:43:38,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:38,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:43:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:38,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:43:38,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:43:38,351 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:43:38,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:38,450 INFO L93 Difference]: Finished difference Result 1894 states and 2546 transitions. [2022-11-25 22:43:38,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:43:38,451 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:43:38,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:38,454 INFO L225 Difference]: With dead ends: 1894 [2022-11-25 22:43:38,454 INFO L226 Difference]: Without dead ends: 1888 [2022-11-25 22:43:38,455 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:43:38,455 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:43:38,456 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:43:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2022-11-25 22:43:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1888. [2022-11-25 22:43:38,478 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:43:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2540 transitions. [2022-11-25 22:43:38,481 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2540 transitions. Word has length 88 [2022-11-25 22:43:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:38,481 INFO L495 AbstractCegarLoop]: Abstraction has 1888 states and 2540 transitions. [2022-11-25 22:43:38,482 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:43:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2540 transitions. [2022-11-25 22:43:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 22:43:38,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:38,483 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:43:38,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:38,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:38,697 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:43:38,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:38,697 INFO L85 PathProgramCache]: Analyzing trace with hash -385822936, now seen corresponding path program 1 times [2022-11-25 22:43:38,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:38,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833720801] [2022-11-25 22:43:38,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:38,698 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:43:38,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:38,700 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:38,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:39,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:43:39,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:39,169 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:43:39,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:39,351 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:43:39,351 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:39,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833720801] [2022-11-25 22:43:39,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833720801] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:43:39,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1634262606] [2022-11-25 22:43:39,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:39,352 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:43:39,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:43:39,359 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:43:39,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-25 22:43:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:40,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:43:40,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:40,053 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:43:40,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:40,136 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:43:40,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1634262606] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:43:40,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707231759] [2022-11-25 22:43:40,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:40,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:40,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:43:40,142 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:43:40,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-25 22:43:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:40,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:43:40,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:40,560 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:43:40,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:40,635 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:43:40,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707231759] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:43:40,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:43:40,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2022-11-25 22:43:40,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899900573] [2022-11-25 22:43:40,636 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:43:40,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 22:43:40,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:40,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 22:43:40,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 22:43:40,638 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:43:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:40,935 INFO L93 Difference]: Finished difference Result 1914 states and 2570 transitions. [2022-11-25 22:43:40,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 22:43:40,938 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:43:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:40,942 INFO L225 Difference]: With dead ends: 1914 [2022-11-25 22:43:40,942 INFO L226 Difference]: Without dead ends: 1902 [2022-11-25 22:43:40,942 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:43:40,943 INFO L413 NwaCegarLoop]: 1175 mSDtfsCounter, 36 mSDsluCounter, 7006 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:43:40,943 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:43:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2022-11-25 22:43:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1896. [2022-11-25 22:43:40,964 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:43:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2550 transitions. [2022-11-25 22:43:40,968 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2550 transitions. Word has length 89 [2022-11-25 22:43:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:40,968 INFO L495 AbstractCegarLoop]: Abstraction has 1896 states and 2550 transitions. [2022-11-25 22:43:40,968 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:43:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2550 transitions. [2022-11-25 22:43:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-25 22:43:40,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:40,970 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:43:40,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:41,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:41,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:41,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:41,576 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:43:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:41,577 INFO L85 PathProgramCache]: Analyzing trace with hash 55938262, now seen corresponding path program 2 times [2022-11-25 22:43:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:41,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821020646] [2022-11-25 22:43:41,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:43:41,578 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:43:41,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:41,579 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:41,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:43:42,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:43:42,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:43:42,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 22:43:42,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:42,418 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:43:42,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:42,780 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:43:42,781 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:42,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821020646] [2022-11-25 22:43:42,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821020646] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:43:42,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1445133489] [2022-11-25 22:43:42,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:43:42,783 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:43:42,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:43:42,784 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:43:42,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-25 22:43:45,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:43:45,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:43:45,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 22:43:45,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:45,180 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:43:45,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:45,303 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:43:45,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1445133489] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:43:45,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841017403] [2022-11-25 22:43:45,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:43:45,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:45,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:43:45,308 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:43:45,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-25 22:44:39,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:44:39,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:44:39,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 22:44:39,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:39,944 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:44:39,944 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:39,978 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:40,556 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:44:40,556 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:40,645 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:40,702 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:44:40,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:44:40,871 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-25 22:44:40,872 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:44:40,885 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:44:40,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841017403] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:44:40,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-25 22:44:40,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 14] total 29 [2022-11-25 22:44:40,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041400670] [2022-11-25 22:44:40,888 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-25 22:44:40,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 22:44:40,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:40,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 22:44:40,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=756, Unknown=3, NotChecked=56, Total=930 [2022-11-25 22:44:40,890 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:45:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:00,624 INFO L93 Difference]: Finished difference Result 2415 states and 3208 transitions. [2022-11-25 22:45:00,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-25 22:45:00,625 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:45:00,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:00,629 INFO L225 Difference]: With dead ends: 2415 [2022-11-25 22:45:00,630 INFO L226 Difference]: Without dead ends: 2403 [2022-11-25 22:45:00,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=645, Invalid=3478, Unknown=41, NotChecked=126, Total=4290 [2022-11-25 22:45:00,631 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 968 mSDsluCounter, 10804 mSDsCounter, 0 mSdLazyCounter, 9644 mSolverCounterSat, 59 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s 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, 17.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:00,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 11521 Invalid, 9711 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 9644 Invalid, 8 Unknown, 0 Unchecked, 17.6s Time] [2022-11-25 22:45:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2022-11-25 22:45:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1913. [2022-11-25 22:45:00,656 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:45:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2572 transitions. [2022-11-25 22:45:00,659 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2572 transitions. Word has length 92 [2022-11-25 22:45:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:00,660 INFO L495 AbstractCegarLoop]: Abstraction has 1913 states and 2572 transitions. [2022-11-25 22:45:00,660 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:45:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2572 transitions. [2022-11-25 22:45:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-25 22:45:00,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:00,661 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:45:00,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:00,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:45:01,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:01,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:45:01,272 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:45:01,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:01,273 INFO L85 PathProgramCache]: Analyzing trace with hash 675941271, now seen corresponding path program 1 times [2022-11-25 22:45:01,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:45:01,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917944850] [2022-11-25 22:45:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:01,273 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:01,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:45:01,275 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:01,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:45:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:01,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 22:45:01,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:02,050 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:45:02,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:03,152 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:45:03,155 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:45:03,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917944850] [2022-11-25 22:45:03,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917944850] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:45:03,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [6594977] [2022-11-25 22:45:03,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:03,156 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:45:03,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:45:03,157 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:45:03,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-25 22:45:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:04,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 22:45:04,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:04,103 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:45:04,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:04,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:45:04,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [6594977] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:45:04,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252328542] [2022-11-25 22:45:04,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:04,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:45:04,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:45:04,370 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:45:04,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-25 22:45:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:04,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 22:45:04,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:04,982 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:45:04,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:06,841 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:45:06,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252328542] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:45:06,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:45:06,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15, 15] total 41 [2022-11-25 22:45:06,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058679771] [2022-11-25 22:45:06,841 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:45:06,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-25 22:45:06,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:45:06,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-25 22:45:06,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1187, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 22:45:06,844 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:45:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:11,398 INFO L93 Difference]: Finished difference Result 2021 states and 2710 transitions. [2022-11-25 22:45:11,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-25 22:45:11,399 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:45:11,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:11,402 INFO L225 Difference]: With dead ends: 2021 [2022-11-25 22:45:11,402 INFO L226 Difference]: Without dead ends: 2003 [2022-11-25 22:45:11,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1810, Invalid=3890, Unknown=0, NotChecked=0, Total=5700 [2022-11-25 22:45:11,404 INFO L413 NwaCegarLoop]: 1192 mSDtfsCounter, 180 mSDsluCounter, 18937 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:11,405 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.7s Time] [2022-11-25 22:45:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2022-11-25 22:45:11,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1949. [2022-11-25 22:45:11,426 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:45:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2618 transitions. [2022-11-25 22:45:11,430 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2618 transitions. Word has length 98 [2022-11-25 22:45:11,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:11,430 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 2618 transitions. [2022-11-25 22:45:11,430 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:45:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2618 transitions. [2022-11-25 22:45:11,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-25 22:45:11,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:11,432 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:45:11,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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)] Ended with exit code 0 [2022-11-25 22:45:11,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:11,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:12,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:45:12,048 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:45:12,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2055264535, now seen corresponding path program 2 times [2022-11-25 22:45:12,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:45:12,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551680725] [2022-11-25 22:45:12,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:45:12,049 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:12,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:45:12,050 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:12,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:45:12,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:45:12,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:45:12,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 22:45:12,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:45:13,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:20,477 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:45:20,478 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:45:20,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551680725] [2022-11-25 22:45:20,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551680725] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:45:20,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2061248473] [2022-11-25 22:45:20,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:45:20,478 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:45:20,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:45:20,479 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:45:20,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-25 22:45:23,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:45:23,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:45:23,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 22:45:23,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:23,493 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:45:23,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:25,368 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:45:25,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2061248473] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:45:25,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860718352] [2022-11-25 22:45:25,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:45:25,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:45:25,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:45:25,372 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:45:25,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-25 22:47:02,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:47:02,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:47:02,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-25 22:47:02,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:47:02,537 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:47:02,695 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:47:02,696 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:02,839 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:02,850 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:47:03,277 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:47:03,282 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:47:07,297 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:47:07,354 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:47:07,354 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:47:07,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:47:07,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:47:07,594 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:47:07,720 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:47:07,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:47:08,681 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:47:08,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860718352] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:47:08,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-25 22:47:08,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27, 27, 13] total 64 [2022-11-25 22:47:08,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109070706] [2022-11-25 22:47:08,690 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-25 22:47:08,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-25 22:47:08,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:47:08,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-25 22:47:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=3404, Unknown=3, NotChecked=254, Total=4422 [2022-11-25 22:47:08,693 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:49:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:49:16,987 INFO L93 Difference]: Finished difference Result 2624 states and 3506 transitions. [2022-11-25 22:49:16,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-25 22:49:16,989 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:49:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:49:16,994 INFO L225 Difference]: With dead ends: 2624 [2022-11-25 22:49:16,995 INFO L226 Difference]: Without dead ends: 2606 [2022-11-25 22:49:17,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 461 SyntacticMatches, 25 SemanticMatches, 148 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6264 ImplicationChecksByTransitivity, 53.9s TimeCoverageRelationStatistics Valid=3676, Invalid=18057, Unknown=31, NotChecked=586, Total=22350 [2022-11-25 22:49:17,001 INFO L413 NwaCegarLoop]: 728 mSDtfsCounter, 1326 mSDsluCounter, 23074 mSDsCounter, 0 mSdLazyCounter, 24111 mSolverCounterSat, 103 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 23802 SdHoareTripleChecker+Invalid, 25524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 24111 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 1300 IncrementalHoareTripleChecker+Unchecked, 84.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:49:17,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 23802 Invalid, 25524 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [103 Valid, 24111 Invalid, 10 Unknown, 1300 Unchecked, 84.6s Time] [2022-11-25 22:49:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2022-11-25 22:49:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2020. [2022-11-25 22:49:17,052 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:49:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2712 transitions. [2022-11-25 22:49:17,056 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2712 transitions. Word has length 110 [2022-11-25 22:49:17,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:49:17,057 INFO L495 AbstractCegarLoop]: Abstraction has 2020 states and 2712 transitions. [2022-11-25 22:49:17,057 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:49:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2712 transitions. [2022-11-25 22:49:17,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-25 22:49:17,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:49:17,061 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:49:17,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-11-25 22:49:17,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-25 22:49:17,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:49:17,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:49:17,674 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:49:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:49:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1849192087, now seen corresponding path program 1 times [2022-11-25 22:49:17,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:49:17,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213946561] [2022-11-25 22:49:17,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:49:17,676 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:17,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:49:17,677 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:17,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:49:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:49:18,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-25 22:49:18,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:49:18,809 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:19,062 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:49:19,062 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:19,104 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:19,249 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:22,111 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:22,111 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:22,288 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:22,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 36 treesize of output 37 [2022-11-25 22:49:22,317 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:22,384 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:22,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:49:22,500 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:49:22,517 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:49:22,963 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:49:22,966 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:49:22,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213946561] [2022-11-25 22:49:22,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213946561] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:49:22,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [321659541] [2022-11-25 22:49:22,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:49:22,967 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:49:22,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:49:22,972 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:49:22,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-25 22:49:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:49:29,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 22:49:29,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:49:29,489 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:29,672 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:49:29,672 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:29,699 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:29,781 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:32,662 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:32,663 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:32,771 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:32,771 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:32,799 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:32,811 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:32,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:49:32,832 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:49:32,846 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:49:33,214 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:49:33,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [321659541] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:49:33,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604490340] [2022-11-25 22:49:33,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:49:33,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:49:33,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:49:33,218 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:49:33,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-25 22:49:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:49:34,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-25 22:49:34,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:49:34,269 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:49:34,270 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:34,321 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:37,799 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:37,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:49:38,019 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:49:38,019 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:38,042 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:38,047 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:38,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:49:40,214 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:49:40,668 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-25 22:49:40,669 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:49:40,681 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:49:40,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604490340] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:49:40,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:49:40,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 26 [2022-11-25 22:49:40,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725384173] [2022-11-25 22:49:40,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:49:40,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 22:49:40,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:49:40,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 22:49:40,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=702, Unknown=34, NotChecked=488, Total=1332 [2022-11-25 22:49:40,687 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:50:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:50:20,958 INFO L93 Difference]: Finished difference Result 2680 states and 3509 transitions. [2022-11-25 22:50:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 22:50:20,959 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:50:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:50:20,963 INFO L225 Difference]: With dead ends: 2680 [2022-11-25 22:50:20,963 INFO L226 Difference]: Without dead ends: 2680 [2022-11-25 22:50:20,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 259 SyntacticMatches, 131 SemanticMatches, 51 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1612 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=246, Invalid=1712, Unknown=54, NotChecked=744, Total=2756 [2022-11-25 22:50:20,965 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 1895 mSDsluCounter, 11181 mSDsCounter, 0 mSdLazyCounter, 12096 mSolverCounterSat, 54 mSolverCounterUnsat, 1047 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 11977 SdHoareTripleChecker+Invalid, 13197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 12096 IncrementalHoareTripleChecker+Invalid, 1047 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:50:20,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 11977 Invalid, 13197 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 12096 Invalid, 1047 Unknown, 0 Unchecked, 38.7s Time] [2022-11-25 22:50:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2022-11-25 22:50:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2017. [2022-11-25 22:50:20,998 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:50:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2706 transitions. [2022-11-25 22:50:21,002 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2706 transitions. Word has length 135 [2022-11-25 22:50:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:50:21,003 INFO L495 AbstractCegarLoop]: Abstraction has 2017 states and 2706 transitions. [2022-11-25 22:50:21,003 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:50:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2706 transitions. [2022-11-25 22:50:21,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-25 22:50:21,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:50:21,005 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:50:21,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:50:21,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-25 22:50:21,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-11-25 22:50:21,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:50:21,620 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:50:21,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:50:21,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1849192088, now seen corresponding path program 1 times [2022-11-25 22:50:21,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:50:21,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262186726] [2022-11-25 22:50:21,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:50:21,621 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:21,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:50:21,622 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:21,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:50:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:50:23,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-25 22:50:23,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:50:23,118 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:50:23,600 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:50:23,671 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:50:23,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:50:23,729 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:50:23,739 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:23,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-25 22:50:23,959 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:50:27,160 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5646) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5645 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5645) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 22:50:27,229 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:27,230 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:50:27,241 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:50:27,455 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:27,455 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:50:27,472 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:50:27,508 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:50:27,517 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:50:27,571 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:27,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:50:27,878 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:50:27,923 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:50:29,397 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:50:29,412 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:50:29,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262186726] [2022-11-25 22:50:29,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262186726] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:50:29,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1686499924] [2022-11-25 22:50:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:50:29,413 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:50:29,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:50:29,414 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:50:29,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-11-25 22:50:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:50:34,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-25 22:50:34,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:50:34,891 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:50:34,900 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:50:35,834 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:50:35,834 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:50:35,860 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:50:35,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:50:35,985 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:36,157 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:50:36,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 7 treesize of output 3 [2022-11-25 22:50:42,191 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:50:42,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:50:42,565 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:50:42,595 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-25 22:50:42,596 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:50:42,825 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:50:42,831 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:50:43,016 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:50:43,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:50:43,742 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:50:53,002 WARN L233 SmtUtils]: Spent 7.34s 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:50:53,638 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:50:53,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1686499924] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:50:53,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272533140] [2022-11-25 22:50:53,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:50:53,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:50:53,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:50:53,665 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:50:53,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-25 22:50:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:50:54,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-25 22:50:54,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:50:55,087 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:50:55,131 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:50:55,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:50:55,329 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:55,345 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:50:55,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 22:50:55,811 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:50:59,240 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:50:59,328 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:59,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:50:59,341 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:50:59,817 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:50:59,818 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:50:59,826 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:50:59,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:50:59,876 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:50:59,881 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:59,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:50:59,981 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:51:00,023 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:51:01,409 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:51:01,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272533140] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:51:01,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:51:01,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 36 [2022-11-25 22:51:01,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924717745] [2022-11-25 22:51:01,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:51:01,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-25 22:51:01,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:51:01,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-25 22:51:01,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1337, Unknown=45, NotChecked=738, Total=2256 [2022-11-25 22:51:01,429 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:52:52,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:52:52,601 INFO L93 Difference]: Finished difference Result 3372 states and 4446 transitions. [2022-11-25 22:52:52,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 22:52:52,602 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:52:52,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:52:52,606 INFO L225 Difference]: With dead ends: 3372 [2022-11-25 22:52:52,606 INFO L226 Difference]: Without dead ends: 3372 [2022-11-25 22:52:52,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 249 SyntacticMatches, 131 SemanticMatches, 61 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=278, Invalid=2558, Unknown=62, NotChecked=1008, Total=3906 [2022-11-25 22:52:52,608 INFO L413 NwaCegarLoop]: 911 mSDtfsCounter, 2987 mSDsluCounter, 15296 mSDsCounter, 0 mSdLazyCounter, 32342 mSolverCounterSat, 64 mSolverCounterUnsat, 1571 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2992 SdHoareTripleChecker+Valid, 16207 SdHoareTripleChecker+Invalid, 37789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 32342 IncrementalHoareTripleChecker+Invalid, 1571 IncrementalHoareTripleChecker+Unknown, 3812 IncrementalHoareTripleChecker+Unchecked, 107.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:52:52,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2992 Valid, 16207 Invalid, 37789 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [64 Valid, 32342 Invalid, 1571 Unknown, 3812 Unchecked, 107.9s Time] [2022-11-25 22:52:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2022-11-25 22:52:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 2363. [2022-11-25 22:52:52,649 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:52:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3359 transitions. [2022-11-25 22:52:52,654 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3359 transitions. Word has length 135 [2022-11-25 22:52:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:52:52,655 INFO L495 AbstractCegarLoop]: Abstraction has 2363 states and 3359 transitions. [2022-11-25 22:52:52,655 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:52:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3359 transitions. [2022-11-25 22:52:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-25 22:52:52,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:52:52,658 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:52:52,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-11-25 22:52:52,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:52:53,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-25 22:52:53,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:52:53,272 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:52:53,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:52:53,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2031259997, now seen corresponding path program 1 times [2022-11-25 22:52:53,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:52:53,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581175683] [2022-11-25 22:52:53,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:52:53,274 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:52:53,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:52:53,276 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:52:53,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:52:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:52:54,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 22:52:54,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:52:54,848 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:52:55,121 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:52:55,121 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:52:55,166 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:52:55,373 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:52:58,990 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (and (not (= v_arrayElimCell_85 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_20|)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_20|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_85) (_ bv1 1))))) (exists ((v_ArrVal_7264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7264)))) is different from true [2022-11-25 22:52:59,096 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:52:59,097 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:52:59,295 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:52:59,295 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:52:59,451 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:52:59,451 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:52:59,493 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:52:59,568 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:52:59,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:52:59,690 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:52:59,705 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:52:59,729 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:52:59,749 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:53:00,241 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:53:00,245 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:53:00,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581175683] [2022-11-25 22:53:00,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581175683] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:53:00,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [218241424] [2022-11-25 22:53:00,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:53:00,246 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:53:00,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:53:00,247 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:53:00,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-11-25 22:53:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:53:13,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-25 22:53:13,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:53:13,139 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:53:13,376 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:53:13,377 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:53:13,401 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:53:13,490 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:53:16,931 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:53:16,932 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:53:17,052 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:53:17,053 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:53:17,136 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:53:17,136 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:53:17,169 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:53:17,196 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:53:17,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:53:19,353 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:53:19,380 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:53:19,402 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:53:19,884 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:53:19,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [218241424] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:53:19,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162175053] [2022-11-25 22:53:19,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:53:19,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:53:19,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:53:19,891 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:53:19,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-25 22:53:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:53:21,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-25 22:53:21,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:53:21,340 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:53:21,340 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:53:21,407 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:53:26,101 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:53:26,101 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:53:26,362 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:53:26,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:53:26,532 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:53:26,532 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:53:26,556 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:53:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-25 22:53:26,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:53:26,590 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8268) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:53:26,606 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:53:26,630 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:53:26,651 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:53:27,146 INFO L321 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2022-11-25 22:53:27,147 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:53:27,165 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:53:27,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162175053] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:53:27,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:53:27,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 29 [2022-11-25 22:53:27,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111273212] [2022-11-25 22:53:27,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:53:27,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 22:53:27,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:53:27,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 22:53:27,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=810, Unknown=45, NotChecked=1080, Total=2070 [2022-11-25 22:53:27,171 INFO L87 Difference]: Start difference. First operand 2363 states and 3359 transitions. Second operand has 30 states, 27 states have (on average 4.62962962962963) internal successors, (125), 26 states have internal predecessors, (125), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 22:54:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:54:02,877 INFO L93 Difference]: Finished difference Result 3025 states and 4160 transitions. [2022-11-25 22:54:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 22:54:02,878 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 4.62962962962963) internal successors, (125), 26 states have internal predecessors, (125), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 138 [2022-11-25 22:54:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:54:02,881 INFO L225 Difference]: With dead ends: 3025 [2022-11-25 22:54:02,882 INFO L226 Difference]: Without dead ends: 3025 [2022-11-25 22:54:02,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 269 SyntacticMatches, 131 SemanticMatches, 61 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=285, Invalid=1964, Unknown=67, NotChecked=1590, Total=3906 [2022-11-25 22:54:02,883 INFO L413 NwaCegarLoop]: 795 mSDtfsCounter, 1894 mSDsluCounter, 8523 mSDsCounter, 0 mSdLazyCounter, 9211 mSolverCounterSat, 56 mSolverCounterUnsat, 1086 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 9318 SdHoareTripleChecker+Invalid, 11738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 9211 IncrementalHoareTripleChecker+Invalid, 1086 IncrementalHoareTripleChecker+Unknown, 1385 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:54:02,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 9318 Invalid, 11738 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 9211 Invalid, 1086 Unknown, 1385 Unchecked, 34.0s Time] [2022-11-25 22:54:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2022-11-25 22:54:02,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 2362. [2022-11-25 22:54:02,922 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:54:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3357 transitions. [2022-11-25 22:54:02,928 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3357 transitions. Word has length 138 [2022-11-25 22:54:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:54:02,928 INFO L495 AbstractCegarLoop]: Abstraction has 2362 states and 3357 transitions. [2022-11-25 22:54:02,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 4.62962962962963) internal successors, (125), 26 states have internal predecessors, (125), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 22:54:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3357 transitions. [2022-11-25 22:54:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-25 22:54:02,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:54:02,931 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:54:02,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-25 22:54:03,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:54:03,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2022-11-25 22:54:03,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:54:03,554 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:54:03,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:54:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2031259998, now seen corresponding path program 1 times [2022-11-25 22:54:03,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:54:03,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688225499] [2022-11-25 22:54:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:54:03,556 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:54:03,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:54:03,557 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:54:03,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/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:54:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:54:05,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-25 22:54:05,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:54:05,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:54:05,799 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:54:05,871 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:54:05,871 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:54:05,954 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:54:05,974 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:54:06,209 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:54:06,222 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:54:09,849 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:54:09,939 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:54:09,940 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:54:09,957 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:54:10,214 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:54:10,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:54:10,223 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:54:10,447 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:54:10,448 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:54:10,458 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:54:10,522 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:54:10,527 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:54:10,614 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:54:10,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:54:11,042 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32)))) (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:54:11,104 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:54:11,198 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:54:11,268 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:54:12,609 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:54:12,623 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:54:12,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688225499] [2022-11-25 22:54:12,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688225499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:54:12,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [667313096] [2022-11-25 22:54:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:54:12,624 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:54:12,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:54:12,625 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:54:12,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-11-25 22:54:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:54:20,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 125 conjunts are in the unsatisfiable core [2022-11-25 22:54:20,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:54:20,375 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:54:20,760 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:54:20,800 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:54:20,801 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:54:20,897 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:54:20,913 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:54:21,228 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:54:21,234 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:54:24,585 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:54:24,681 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:54:24,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:54:24,698 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:54:24,980 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:54:24,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:54:24,989 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:54:25,199 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:54:25,200 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:54:25,209 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:54:25,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:54:25,262 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:54:25,273 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:54:25,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:54:25,379 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:54:25,433 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:54:25,551 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:54:25,759 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:54:39,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [667313096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:54:39,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263828931] [2022-11-25 22:54:39,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:54:39,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:54:39,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:54:39,883 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:54:39,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dfedeb3-80d1-4865-8a58-f4d3d0e6e446/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-25 22:54:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:54:41,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-25 22:54:41,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:54:41,663 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:54:41,750 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:54:41,750 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:54:41,783 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:54:41,815 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:54:42,000 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:54:42,010 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:54:50,042 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:54:50,043 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:54:50,067 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:54:50,403 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:54:50,404 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:54:50,442 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:54:50,592 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:54:50,592 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:54:50,606 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:54:50,683 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:54:50,691 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:54:50,712 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:54:50,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:54:50,862 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:54:50,933 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:54:51,206 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:54:51,390 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:54:54,213 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:54:54,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263828931] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:54:54,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:54:54,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 25 [2022-11-25 22:54:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293533343] [2022-11-25 22:54:54,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:54:54,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 22:54:54,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:54:54,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 22:54:54,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=602, Unknown=51, NotChecked=1040, Total=1806 [2022-11-25 22:54:54,238 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)