./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 2329fc70 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_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee --- 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-2329fc7 [2022-12-14 11:14:15,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:14:15,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:14:15,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:14:15,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:14:15,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:14:15,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:14:15,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:14:15,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:14:15,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:14:15,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:14:15,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:14:15,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:14:15,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:14:15,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:14:15,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:14:15,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:14:15,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:14:15,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:14:15,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:14:15,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:14:15,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:14:15,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:14:15,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:14:15,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:14:15,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:14:15,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:14:15,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:14:15,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:14:15,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:14:15,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:14:15,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:14:15,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:14:15,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:14:15,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:14:15,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:14:15,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:14:15,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:14:15,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:14:15,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:14:15,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:14:15,443 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-12-14 11:14:15,459 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:14:15,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:14:15,460 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:14:15,460 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:14:15,460 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:14:15,460 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:14:15,460 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:14:15,461 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:14:15,461 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:14:15,461 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:14:15,461 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:14:15,461 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:14:15,461 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:14:15,461 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:14:15,461 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:14:15,462 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:14:15,462 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:14:15,462 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:14:15,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 11:14:15,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 11:14:15,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:14:15,463 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:14:15,463 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 11:14:15,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:14:15,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:14:15,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:14:15,464 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 11:14:15,464 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 11:14:15,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:14:15,464 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 11:14:15,464 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:14:15,464 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:14:15,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:14:15,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:14:15,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:14:15,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:14:15,465 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:14:15,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:14:15,466 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:14:15,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:14:15,466 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:14:15,466 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_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/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_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh 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-memcleanup) ) 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 -> dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee [2022-12-14 11:14:15,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:14:15,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:14:15,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:14:15,683 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:14:15,683 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:14:15,684 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/forester-heap/dll-01-1.i [2022-12-14 11:14:18,304 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:14:18,462 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:14:18,462 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i [2022-12-14 11:14:18,470 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/data/521a15492/d04875a2903641ef94fae4ac790344cb/FLAG334582aa4 [2022-12-14 11:14:18,481 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/data/521a15492/d04875a2903641ef94fae4ac790344cb [2022-12-14 11:14:18,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:14:18,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:14:18,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:14:18,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:14:18,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:14:18,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:14:18" (1/1) ... [2022-12-14 11:14:18,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26074d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18, skipping insertion in model container [2022-12-14 11:14:18,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:14:18" (1/1) ... [2022-12-14 11:14:18,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:14:18,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:14:18,691 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2022-12-14 11:14:18,696 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2022-12-14 11:14:18,698 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2022-12-14 11:14:18,699 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2022-12-14 11:14:18,701 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2022-12-14 11:14:18,702 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2022-12-14 11:14:18,703 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2022-12-14 11:14:18,704 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2022-12-14 11:14:18,704 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2022-12-14 11:14:18,705 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2022-12-14 11:14:18,706 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2022-12-14 11:14:18,707 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2022-12-14 11:14:18,708 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2022-12-14 11:14:18,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:14:18,718 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:14:18,742 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2022-12-14 11:14:18,744 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2022-12-14 11:14:18,745 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2022-12-14 11:14:18,746 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2022-12-14 11:14:18,748 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2022-12-14 11:14:18,749 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2022-12-14 11:14:18,750 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2022-12-14 11:14:18,751 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2022-12-14 11:14:18,751 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2022-12-14 11:14:18,752 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2022-12-14 11:14:18,753 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2022-12-14 11:14:18,753 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2022-12-14 11:14:18,754 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_7f125646-23ad-4f09-9fd2-68657fb359ef/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2022-12-14 11:14:18,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:14:18,771 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:14:18,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18 WrapperNode [2022-12-14 11:14:18,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:14:18,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:14:18,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:14:18,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:14:18,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18" (1/1) ... [2022-12-14 11:14:18,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18" (1/1) ... [2022-12-14 11:14:18,804 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2022-12-14 11:14:18,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:14:18,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:14:18,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:14:18,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:14:18,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18" (1/1) ... [2022-12-14 11:14:18,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18" (1/1) ... [2022-12-14 11:14:18,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18" (1/1) ... [2022-12-14 11:14:18,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18" (1/1) ... [2022-12-14 11:14:18,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18" (1/1) ... [2022-12-14 11:14:18,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18" (1/1) ... [2022-12-14 11:14:18,825 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18" (1/1) ... [2022-12-14 11:14:18,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18" (1/1) ... [2022-12-14 11:14:18,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:14:18,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:14:18,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:14:18,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:14:18,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18" (1/1) ... [2022-12-14 11:14:18,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:14:18,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:14:18,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:14:18,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:14:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 11:14:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:14:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 11:14:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 11:14:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:14:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 11:14:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:14:18,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:14:18,986 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:14:18,988 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:14:19,395 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:14:19,430 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:14:19,430 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-12-14 11:14:19,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:14:19 BoogieIcfgContainer [2022-12-14 11:14:19,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:14:19,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:14:19,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:14:19,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:14:19,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:14:18" (1/3) ... [2022-12-14 11:14:19,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e54958e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:14:19, skipping insertion in model container [2022-12-14 11:14:19,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:14:18" (2/3) ... [2022-12-14 11:14:19,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e54958e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:14:19, skipping insertion in model container [2022-12-14 11:14:19,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:14:19" (3/3) ... [2022-12-14 11:14:19,439 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2022-12-14 11:14:19,453 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:14:19,454 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 84 error locations. [2022-12-14 11:14:19,490 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:14:19,495 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;@611bb27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:14:19,495 INFO L358 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2022-12-14 11:14:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 93 states have (on average 2.4301075268817205) internal successors, (226), 177 states have internal predecessors, (226), 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-12-14 11:14:19,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 11:14:19,503 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:19,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 11:14:19,504 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash 14915, now seen corresponding path program 1 times [2022-12-14 11:14:19,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:19,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131897874] [2022-12-14 11:14:19,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:19,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:19,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:19,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131897874] [2022-12-14 11:14:19,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131897874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:19,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:19,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:14:19,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296523450] [2022-12-14 11:14:19,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:19,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:14:19,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:19,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:14:19,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:14:19,688 INFO L87 Difference]: Start difference. First operand has 178 states, 93 states have (on average 2.4301075268817205) internal successors, (226), 177 states have internal predecessors, (226), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-12-14 11:14:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:19,844 INFO L93 Difference]: Finished difference Result 177 states and 185 transitions. [2022-12-14 11:14:19,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:14:19,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-12-14 11:14:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:19,853 INFO L225 Difference]: With dead ends: 177 [2022-12-14 11:14:19,853 INFO L226 Difference]: Without dead ends: 175 [2022-12-14 11:14:19,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-14 11:14:19,856 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 169 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:19,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 93 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:19,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-12-14 11:14:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2022-12-14 11:14:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 170 states have internal predecessors, (182), 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-12-14 11:14:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2022-12-14 11:14:19,884 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 2 [2022-12-14 11:14:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:19,884 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2022-12-14 11:14:19,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-12-14 11:14:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2022-12-14 11:14:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 11:14:19,885 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:19,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 11:14:19,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 11:14:19,885 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:19,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:19,886 INFO L85 PathProgramCache]: Analyzing trace with hash 14916, now seen corresponding path program 1 times [2022-12-14 11:14:19,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:19,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230655912] [2022-12-14 11:14:19,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:19,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:19,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:19,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230655912] [2022-12-14 11:14:19,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230655912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:19,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:19,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:14:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768209758] [2022-12-14 11:14:19,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:19,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:14:19,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:19,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:14:19,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:14:19,961 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-12-14 11:14:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:20,071 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2022-12-14 11:14:20,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:14:20,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-12-14 11:14:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:20,073 INFO L225 Difference]: With dead ends: 197 [2022-12-14 11:14:20,073 INFO L226 Difference]: Without dead ends: 197 [2022-12-14 11:14:20,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-14 11:14:20,074 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 159 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:20,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 119 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-12-14 11:14:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 178. [2022-12-14 11:14:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 111 states have (on average 1.8018018018018018) internal successors, (200), 177 states have internal predecessors, (200), 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-12-14 11:14:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 200 transitions. [2022-12-14 11:14:20,086 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 200 transitions. Word has length 2 [2022-12-14 11:14:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:20,086 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 200 transitions. [2022-12-14 11:14:20,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-12-14 11:14:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 200 transitions. [2022-12-14 11:14:20,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 11:14:20,087 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:20,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 11:14:20,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 11:14:20,087 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash 444309189, now seen corresponding path program 1 times [2022-12-14 11:14:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:20,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110046091] [2022-12-14 11:14:20,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:20,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:20,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110046091] [2022-12-14 11:14:20,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110046091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:20,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:20,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:14:20,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682023713] [2022-12-14 11:14:20,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:20,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:14:20,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:20,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:14:20,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:14:20,130 INFO L87 Difference]: Start difference. First operand 178 states and 200 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:14:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:20,181 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2022-12-14 11:14:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:14:20,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 11:14:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:20,182 INFO L225 Difference]: With dead ends: 193 [2022-12-14 11:14:20,182 INFO L226 Difference]: Without dead ends: 193 [2022-12-14 11:14:20,182 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-12-14 11:14:20,183 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:20,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 159 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:14:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-12-14 11:14:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2022-12-14 11:14:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 110 states have (on average 1.790909090909091) internal successors, (197), 175 states have internal predecessors, (197), 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-12-14 11:14:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2022-12-14 11:14:20,192 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 5 [2022-12-14 11:14:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:20,192 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2022-12-14 11:14:20,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:14:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2022-12-14 11:14:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 11:14:20,193 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:20,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:14:20,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 11:14:20,193 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:20,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:20,193 INFO L85 PathProgramCache]: Analyzing trace with hash 157267736, now seen corresponding path program 1 times [2022-12-14 11:14:20,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:20,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334066149] [2022-12-14 11:14:20,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:20,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:20,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:20,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334066149] [2022-12-14 11:14:20,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334066149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:20,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:20,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:14:20,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101909992] [2022-12-14 11:14:20,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:20,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:14:20,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:20,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:14:20,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:14:20,308 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-12-14 11:14:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:20,454 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2022-12-14 11:14:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:14:20,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-12-14 11:14:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:20,456 INFO L225 Difference]: With dead ends: 175 [2022-12-14 11:14:20,456 INFO L226 Difference]: Without dead ends: 175 [2022-12-14 11:14:20,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:14:20,457 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 3 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:20,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 421 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-12-14 11:14:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-12-14 11:14:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 110 states have (on average 1.7818181818181817) internal successors, (196), 174 states have internal predecessors, (196), 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-12-14 11:14:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2022-12-14 11:14:20,465 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 10 [2022-12-14 11:14:20,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:20,465 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2022-12-14 11:14:20,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-12-14 11:14:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2022-12-14 11:14:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 11:14:20,465 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:20,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:14:20,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 11:14:20,466 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:20,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:20,466 INFO L85 PathProgramCache]: Analyzing trace with hash 157267737, now seen corresponding path program 1 times [2022-12-14 11:14:20,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:20,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576255470] [2022-12-14 11:14:20,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:20,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:20,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:20,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:20,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576255470] [2022-12-14 11:14:20,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576255470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:20,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:20,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:14:20,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718821159] [2022-12-14 11:14:20,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:20,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:14:20,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:20,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:14:20,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:14:20,613 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-12-14 11:14:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:20,768 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2022-12-14 11:14:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:14:20,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-12-14 11:14:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:20,769 INFO L225 Difference]: With dead ends: 174 [2022-12-14 11:14:20,770 INFO L226 Difference]: Without dead ends: 174 [2022-12-14 11:14:20,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:14:20,771 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:20,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 432 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-12-14 11:14:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-12-14 11:14:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 110 states have (on average 1.7727272727272727) internal successors, (195), 173 states have internal predecessors, (195), 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-12-14 11:14:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 195 transitions. [2022-12-14 11:14:20,777 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 195 transitions. Word has length 10 [2022-12-14 11:14:20,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:20,777 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 195 transitions. [2022-12-14 11:14:20,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-12-14 11:14:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 195 transitions. [2022-12-14 11:14:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 11:14:20,778 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:20,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:14:20,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 11:14:20,778 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:20,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash 810842142, now seen corresponding path program 1 times [2022-12-14 11:14:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:20,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695316899] [2022-12-14 11:14:20,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:20,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:20,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:20,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695316899] [2022-12-14 11:14:20,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695316899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:20,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:20,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:14:20,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416851941] [2022-12-14 11:14:20,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:20,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:14:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:14:20,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:14:20,980 INFO L87 Difference]: Start difference. First operand 174 states and 195 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 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-12-14 11:14:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:21,217 INFO L93 Difference]: Finished difference Result 174 states and 194 transitions. [2022-12-14 11:14:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:14:21,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 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 12 [2022-12-14 11:14:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:21,218 INFO L225 Difference]: With dead ends: 174 [2022-12-14 11:14:21,218 INFO L226 Difference]: Without dead ends: 174 [2022-12-14 11:14:21,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-14 11:14:21,219 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 151 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:21,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 441 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:14:21,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-12-14 11:14:21,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2022-12-14 11:14:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 110 states have (on average 1.7636363636363637) internal successors, (194), 172 states have internal predecessors, (194), 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-12-14 11:14:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 194 transitions. [2022-12-14 11:14:21,224 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 194 transitions. Word has length 12 [2022-12-14 11:14:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:21,224 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 194 transitions. [2022-12-14 11:14:21,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 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-12-14 11:14:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 194 transitions. [2022-12-14 11:14:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 11:14:21,225 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:21,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:14:21,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 11:14:21,225 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:21,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash 810842143, now seen corresponding path program 1 times [2022-12-14 11:14:21,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:21,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931469300] [2022-12-14 11:14:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:21,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:21,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:21,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931469300] [2022-12-14 11:14:21,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931469300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:21,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:21,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:14:21,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283909847] [2022-12-14 11:14:21,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:21,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:14:21,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:21,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:14:21,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:14:21,445 INFO L87 Difference]: Start difference. First operand 173 states and 194 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 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-12-14 11:14:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:21,663 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2022-12-14 11:14:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:14:21,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 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 12 [2022-12-14 11:14:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:21,664 INFO L225 Difference]: With dead ends: 173 [2022-12-14 11:14:21,664 INFO L226 Difference]: Without dead ends: 173 [2022-12-14 11:14:21,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-14 11:14:21,665 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 149 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:21,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 299 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:14:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-12-14 11:14:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2022-12-14 11:14:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 110 states have (on average 1.7545454545454546) internal successors, (193), 171 states have internal predecessors, (193), 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-12-14 11:14:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2022-12-14 11:14:21,670 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 12 [2022-12-14 11:14:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:21,670 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2022-12-14 11:14:21,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 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-12-14 11:14:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2022-12-14 11:14:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 11:14:21,670 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:21,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:14:21,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 11:14:21,671 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:21,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:21,671 INFO L85 PathProgramCache]: Analyzing trace with hash 290934283, now seen corresponding path program 1 times [2022-12-14 11:14:21,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:21,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579459180] [2022-12-14 11:14:21,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:21,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:21,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:21,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579459180] [2022-12-14 11:14:21,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579459180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:21,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:21,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:14:21,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047036521] [2022-12-14 11:14:21,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:21,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:14:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:21,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:14:21,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:14:21,696 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-14 11:14:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:21,727 INFO L93 Difference]: Finished difference Result 173 states and 194 transitions. [2022-12-14 11:14:21,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:14:21,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-12-14 11:14:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:21,728 INFO L225 Difference]: With dead ends: 173 [2022-12-14 11:14:21,728 INFO L226 Difference]: Without dead ends: 173 [2022-12-14 11:14:21,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-14 11:14:21,729 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:21,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:14:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-12-14 11:14:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-12-14 11:14:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 111 states have (on average 1.7477477477477477) internal successors, (194), 172 states have internal predecessors, (194), 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-12-14 11:14:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 194 transitions. [2022-12-14 11:14:21,734 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 194 transitions. Word has length 12 [2022-12-14 11:14:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:21,734 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 194 transitions. [2022-12-14 11:14:21,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-14 11:14:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 194 transitions. [2022-12-14 11:14:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 11:14:21,734 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:21,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:14:21,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 11:14:21,735 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:21,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash 429463557, now seen corresponding path program 1 times [2022-12-14 11:14:21,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:21,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321348725] [2022-12-14 11:14:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:21,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:21,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321348725] [2022-12-14 11:14:21,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321348725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:21,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:21,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:14:21,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037458540] [2022-12-14 11:14:21,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:21,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:14:21,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:21,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:14:21,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:14:21,812 INFO L87 Difference]: Start difference. First operand 173 states and 194 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:14:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:21,938 INFO L93 Difference]: Finished difference Result 253 states and 279 transitions. [2022-12-14 11:14:21,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:14:21,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 11:14:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:21,939 INFO L225 Difference]: With dead ends: 253 [2022-12-14 11:14:21,939 INFO L226 Difference]: Without dead ends: 253 [2022-12-14 11:14:21,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:14:21,940 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 85 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:21,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 400 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:21,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-14 11:14:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 170. [2022-12-14 11:14:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 109 states have (on average 1.7522935779816513) internal successors, (191), 169 states have internal predecessors, (191), 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-12-14 11:14:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2022-12-14 11:14:21,945 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 13 [2022-12-14 11:14:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:21,945 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2022-12-14 11:14:21,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:14:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2022-12-14 11:14:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:14:21,946 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:21,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:14:21,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 11:14:21,946 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:21,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:21,947 INFO L85 PathProgramCache]: Analyzing trace with hash -520498923, now seen corresponding path program 1 times [2022-12-14 11:14:21,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:21,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402722325] [2022-12-14 11:14:21,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:21,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:22,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-12-14 11:14:22,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:22,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402722325] [2022-12-14 11:14:22,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402722325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:22,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:22,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:14:22,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274547863] [2022-12-14 11:14:22,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:22,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:14:22,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:22,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:14:22,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:14:22,043 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-12-14 11:14:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:22,148 INFO L93 Difference]: Finished difference Result 253 states and 278 transitions. [2022-12-14 11:14:22,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:14:22,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2022-12-14 11:14:22,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:22,150 INFO L225 Difference]: With dead ends: 253 [2022-12-14 11:14:22,150 INFO L226 Difference]: Without dead ends: 253 [2022-12-14 11:14:22,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-14 11:14:22,151 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 85 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:22,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 356 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-14 11:14:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 172. [2022-12-14 11:14:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 111 states have (on average 1.7387387387387387) internal successors, (193), 171 states have internal predecessors, (193), 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-12-14 11:14:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2022-12-14 11:14:22,155 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 16 [2022-12-14 11:14:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:22,155 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2022-12-14 11:14:22,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-12-14 11:14:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2022-12-14 11:14:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 11:14:22,156 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:22,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:14:22,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 11:14:22,156 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash -17691121, now seen corresponding path program 1 times [2022-12-14 11:14:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:22,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854421387] [2022-12-14 11:14:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:22,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:22,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854421387] [2022-12-14 11:14:22,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854421387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:22,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:22,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:14:22,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015388286] [2022-12-14 11:14:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:22,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:14:22,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:22,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:14:22,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:14:22,200 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-12-14 11:14:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:22,303 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2022-12-14 11:14:22,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:14:22,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2022-12-14 11:14:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:22,305 INFO L225 Difference]: With dead ends: 166 [2022-12-14 11:14:22,305 INFO L226 Difference]: Without dead ends: 166 [2022-12-14 11:14:22,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-14 11:14:22,306 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 225 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:22,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 81 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:22,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-12-14 11:14:22,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2022-12-14 11:14:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 113 states have (on average 1.6194690265486726) internal successors, (183), 161 states have internal predecessors, (183), 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-12-14 11:14:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 183 transitions. [2022-12-14 11:14:22,310 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 183 transitions. Word has length 17 [2022-12-14 11:14:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:22,310 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 183 transitions. [2022-12-14 11:14:22,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-12-14 11:14:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 183 transitions. [2022-12-14 11:14:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 11:14:22,311 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:22,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:14:22,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 11:14:22,311 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:22,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:22,312 INFO L85 PathProgramCache]: Analyzing trace with hash -17691120, now seen corresponding path program 1 times [2022-12-14 11:14:22,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:22,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625594294] [2022-12-14 11:14:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:22,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:22,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:22,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625594294] [2022-12-14 11:14:22,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625594294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:22,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:22,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:14:22,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995613176] [2022-12-14 11:14:22,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:22,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:14:22,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:22,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:14:22,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:14:22,427 INFO L87 Difference]: Start difference. First operand 162 states and 183 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-12-14 11:14:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:22,651 INFO L93 Difference]: Finished difference Result 219 states and 232 transitions. [2022-12-14 11:14:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:14:22,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-12-14 11:14:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:22,652 INFO L225 Difference]: With dead ends: 219 [2022-12-14 11:14:22,652 INFO L226 Difference]: Without dead ends: 219 [2022-12-14 11:14:22,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:14:22,653 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 385 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:22,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 212 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:14:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-14 11:14:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 181. [2022-12-14 11:14:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 132 states have (on average 1.628787878787879) internal successors, (215), 180 states have internal predecessors, (215), 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-12-14 11:14:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 215 transitions. [2022-12-14 11:14:22,658 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 215 transitions. Word has length 17 [2022-12-14 11:14:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:22,658 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 215 transitions. [2022-12-14 11:14:22,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-12-14 11:14:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 215 transitions. [2022-12-14 11:14:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 11:14:22,659 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:22,659 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-12-14 11:14:22,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 11:14:22,659 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:22,659 INFO L85 PathProgramCache]: Analyzing trace with hash 179039567, now seen corresponding path program 1 times [2022-12-14 11:14:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:22,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884160938] [2022-12-14 11:14:22,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:22,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:22,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:22,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884160938] [2022-12-14 11:14:22,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884160938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:22,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:22,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:14:22,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946815993] [2022-12-14 11:14:22,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:22,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:14:22,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:22,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:14:22,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:14:22,736 INFO L87 Difference]: Start difference. First operand 181 states and 215 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-12-14 11:14:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:22,840 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2022-12-14 11:14:22,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:14:22,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-12-14 11:14:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:22,842 INFO L225 Difference]: With dead ends: 180 [2022-12-14 11:14:22,842 INFO L226 Difference]: Without dead ends: 180 [2022-12-14 11:14:22,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:14:22,842 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 6 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:22,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 363 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-12-14 11:14:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2022-12-14 11:14:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 132 states have (on average 1.6136363636363635) internal successors, (213), 179 states have internal predecessors, (213), 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-12-14 11:14:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 213 transitions. [2022-12-14 11:14:22,847 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 213 transitions. Word has length 19 [2022-12-14 11:14:22,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:22,847 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 213 transitions. [2022-12-14 11:14:22,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-12-14 11:14:22,847 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 213 transitions. [2022-12-14 11:14:22,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 11:14:22,848 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:22,848 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-12-14 11:14:22,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 11:14:22,848 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:22,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash 179039568, now seen corresponding path program 1 times [2022-12-14 11:14:22,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:22,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853190279] [2022-12-14 11:14:22,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:22,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:22,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:22,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853190279] [2022-12-14 11:14:22,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853190279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:22,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:22,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:14:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004605377] [2022-12-14 11:14:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:22,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:14:22,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:22,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:14:22,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:14:22,981 INFO L87 Difference]: Start difference. First operand 180 states and 213 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-12-14 11:14:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:23,116 INFO L93 Difference]: Finished difference Result 179 states and 211 transitions. [2022-12-14 11:14:23,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:14:23,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-12-14 11:14:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:23,117 INFO L225 Difference]: With dead ends: 179 [2022-12-14 11:14:23,117 INFO L226 Difference]: Without dead ends: 179 [2022-12-14 11:14:23,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:14:23,118 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 3 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:23,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 353 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-12-14 11:14:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-12-14 11:14:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 132 states have (on average 1.5984848484848484) internal successors, (211), 178 states have internal predecessors, (211), 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-12-14 11:14:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 211 transitions. [2022-12-14 11:14:23,122 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 211 transitions. Word has length 19 [2022-12-14 11:14:23,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:23,122 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 211 transitions. [2022-12-14 11:14:23,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-12-14 11:14:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 211 transitions. [2022-12-14 11:14:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 11:14:23,123 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:23,123 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-12-14 11:14:23,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 11:14:23,123 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:23,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:23,124 INFO L85 PathProgramCache]: Analyzing trace with hash 178758852, now seen corresponding path program 1 times [2022-12-14 11:14:23,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:23,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706404631] [2022-12-14 11:14:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:23,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:23,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:23,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706404631] [2022-12-14 11:14:23,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706404631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:23,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:23,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:14:23,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655480060] [2022-12-14 11:14:23,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:23,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:14:23,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:23,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:14:23,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:14:23,157 INFO L87 Difference]: Start difference. First operand 179 states and 211 transitions. Second operand has 4 states, 4 states have (on average 4.75) 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-12-14 11:14:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:23,247 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2022-12-14 11:14:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:14:23,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) 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-12-14 11:14:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:23,248 INFO L225 Difference]: With dead ends: 207 [2022-12-14 11:14:23,248 INFO L226 Difference]: Without dead ends: 207 [2022-12-14 11:14:23,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-14 11:14:23,248 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 194 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:23,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 202 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-12-14 11:14:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 177. [2022-12-14 11:14:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 131 states have (on average 1.5877862595419847) internal successors, (208), 176 states have internal predecessors, (208), 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-12-14 11:14:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 208 transitions. [2022-12-14 11:14:23,251 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 208 transitions. Word has length 19 [2022-12-14 11:14:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:23,251 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 208 transitions. [2022-12-14 11:14:23,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) 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-12-14 11:14:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 208 transitions. [2022-12-14 11:14:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 11:14:23,252 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:23,252 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-12-14 11:14:23,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 11:14:23,252 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash 258678709, now seen corresponding path program 1 times [2022-12-14 11:14:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:23,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167830243] [2022-12-14 11:14:23,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:23,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:23,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:23,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167830243] [2022-12-14 11:14:23,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167830243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:23,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:23,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:14:23,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622120635] [2022-12-14 11:14:23,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:23,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:14:23,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:23,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:14:23,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:14:23,381 INFO L87 Difference]: Start difference. First operand 177 states and 208 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-12-14 11:14:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:23,596 INFO L93 Difference]: Finished difference Result 177 states and 207 transitions. [2022-12-14 11:14:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:14:23,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-12-14 11:14:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:23,597 INFO L225 Difference]: With dead ends: 177 [2022-12-14 11:14:23,597 INFO L226 Difference]: Without dead ends: 177 [2022-12-14 11:14:23,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-14 11:14:23,597 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 217 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:23,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 249 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:14:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-12-14 11:14:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2022-12-14 11:14:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 131 states have (on average 1.5801526717557253) internal successors, (207), 175 states have internal predecessors, (207), 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-12-14 11:14:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 207 transitions. [2022-12-14 11:14:23,600 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 207 transitions. Word has length 21 [2022-12-14 11:14:23,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:23,600 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 207 transitions. [2022-12-14 11:14:23,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-12-14 11:14:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 207 transitions. [2022-12-14 11:14:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 11:14:23,601 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:23,601 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-12-14 11:14:23,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 11:14:23,601 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:23,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:23,602 INFO L85 PathProgramCache]: Analyzing trace with hash 258678710, now seen corresponding path program 1 times [2022-12-14 11:14:23,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:23,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948435829] [2022-12-14 11:14:23,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:23,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:23,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:23,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948435829] [2022-12-14 11:14:23,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948435829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:23,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:23,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:14:23,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239940261] [2022-12-14 11:14:23,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:23,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 11:14:23,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:23,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 11:14:23,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:14:23,770 INFO L87 Difference]: Start difference. First operand 176 states and 207 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-12-14 11:14:24,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:24,038 INFO L93 Difference]: Finished difference Result 168 states and 198 transitions. [2022-12-14 11:14:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 11:14:24,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-12-14 11:14:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:24,039 INFO L225 Difference]: With dead ends: 168 [2022-12-14 11:14:24,039 INFO L226 Difference]: Without dead ends: 168 [2022-12-14 11:14:24,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-12-14 11:14:24,040 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 225 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:24,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 232 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:14:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-12-14 11:14:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2022-12-14 11:14:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 125 states have (on average 1.52) internal successors, (190), 159 states have internal predecessors, (190), 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-12-14 11:14:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 190 transitions. [2022-12-14 11:14:24,044 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 190 transitions. Word has length 21 [2022-12-14 11:14:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:24,044 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 190 transitions. [2022-12-14 11:14:24,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-12-14 11:14:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 190 transitions. [2022-12-14 11:14:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:14:24,044 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:24,045 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] [2022-12-14 11:14:24,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 11:14:24,045 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:24,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:24,045 INFO L85 PathProgramCache]: Analyzing trace with hash -517860939, now seen corresponding path program 1 times [2022-12-14 11:14:24,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:24,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467139478] [2022-12-14 11:14:24,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:24,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:24,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:24,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467139478] [2022-12-14 11:14:24,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467139478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:24,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:24,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:14:24,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052724402] [2022-12-14 11:14:24,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:24,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:14:24,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:24,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:14:24,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:14:24,129 INFO L87 Difference]: Start difference. First operand 160 states and 190 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-12-14 11:14:24,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:24,237 INFO L93 Difference]: Finished difference Result 160 states and 191 transitions. [2022-12-14 11:14:24,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:14:24,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2022-12-14 11:14:24,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:24,238 INFO L225 Difference]: With dead ends: 160 [2022-12-14 11:14:24,238 INFO L226 Difference]: Without dead ends: 160 [2022-12-14 11:14:24,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:14:24,239 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 178 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:24,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 168 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-12-14 11:14:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2022-12-14 11:14:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.5121951219512195) internal successors, (186), 155 states have internal predecessors, (186), 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-12-14 11:14:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 186 transitions. [2022-12-14 11:14:24,243 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 186 transitions. Word has length 23 [2022-12-14 11:14:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:24,243 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 186 transitions. [2022-12-14 11:14:24,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-12-14 11:14:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 186 transitions. [2022-12-14 11:14:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:14:24,244 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:24,244 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] [2022-12-14 11:14:24,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 11:14:24,244 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:24,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:24,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1670610503, now seen corresponding path program 1 times [2022-12-14 11:14:24,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:24,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781432722] [2022-12-14 11:14:24,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:24,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:24,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781432722] [2022-12-14 11:14:24,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781432722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:24,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:24,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:14:24,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663273628] [2022-12-14 11:14:24,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:24,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:14:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:24,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:14:24,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:14:24,272 INFO L87 Difference]: Start difference. First operand 156 states and 186 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12-14 11:14:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:24,309 INFO L93 Difference]: Finished difference Result 221 states and 266 transitions. [2022-12-14 11:14:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:14:24,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-12-14 11:14:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:24,310 INFO L225 Difference]: With dead ends: 221 [2022-12-14 11:14:24,310 INFO L226 Difference]: Without dead ends: 221 [2022-12-14 11:14:24,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-14 11:14:24,311 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 45 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:24,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 207 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:14:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-12-14 11:14:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 160. [2022-12-14 11:14:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 127 states have (on average 1.5118110236220472) internal successors, (192), 159 states have internal predecessors, (192), 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-12-14 11:14:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 192 transitions. [2022-12-14 11:14:24,315 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 192 transitions. Word has length 24 [2022-12-14 11:14:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:24,315 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 192 transitions. [2022-12-14 11:14:24,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12-14 11:14:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 192 transitions. [2022-12-14 11:14:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:14:24,316 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:24,316 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] [2022-12-14 11:14:24,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 11:14:24,317 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:24,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1670607746, now seen corresponding path program 1 times [2022-12-14 11:14:24,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:24,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107026490] [2022-12-14 11:14:24,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:24,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:24,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:24,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107026490] [2022-12-14 11:14:24,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107026490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:24,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:24,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:14:24,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683170137] [2022-12-14 11:14:24,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:24,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:14:24,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:24,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:14:24,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:14:24,346 INFO L87 Difference]: Start difference. First operand 160 states and 192 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12-14 11:14:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:24,385 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2022-12-14 11:14:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:14:24,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-12-14 11:14:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:24,386 INFO L225 Difference]: With dead ends: 158 [2022-12-14 11:14:24,386 INFO L226 Difference]: Without dead ends: 158 [2022-12-14 11:14:24,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-14 11:14:24,387 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 18 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:24,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 181 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:14:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-12-14 11:14:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-12-14 11:14:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 126 states have (on average 1.5) internal successors, (189), 157 states have internal predecessors, (189), 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-12-14 11:14:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 189 transitions. [2022-12-14 11:14:24,391 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 189 transitions. Word has length 24 [2022-12-14 11:14:24,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:24,391 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 189 transitions. [2022-12-14 11:14:24,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12-14 11:14:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2022-12-14 11:14:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 11:14:24,392 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:24,392 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] [2022-12-14 11:14:24,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 11:14:24,392 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:24,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash -249228235, now seen corresponding path program 1 times [2022-12-14 11:14:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:24,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713818902] [2022-12-14 11:14:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:24,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:24,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713818902] [2022-12-14 11:14:24,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713818902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:24,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:24,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:14:24,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593135473] [2022-12-14 11:14:24,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:24,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:14:24,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:24,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:14:24,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:14:24,529 INFO L87 Difference]: Start difference. First operand 158 states and 189 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-12-14 11:14:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:24,787 INFO L93 Difference]: Finished difference Result 251 states and 278 transitions. [2022-12-14 11:14:24,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 11:14:24,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2022-12-14 11:14:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:24,788 INFO L225 Difference]: With dead ends: 251 [2022-12-14 11:14:24,788 INFO L226 Difference]: Without dead ends: 251 [2022-12-14 11:14:24,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-12-14 11:14:24,789 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 362 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:24,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 410 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:14:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-12-14 11:14:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 169. [2022-12-14 11:14:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.467153284671533) internal successors, (201), 168 states have internal predecessors, (201), 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-12-14 11:14:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2022-12-14 11:14:24,792 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 25 [2022-12-14 11:14:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:24,792 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2022-12-14 11:14:24,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-12-14 11:14:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2022-12-14 11:14:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 11:14:24,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:24,792 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 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-12-14 11:14:24,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 11:14:24,793 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:24,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:24,793 INFO L85 PathProgramCache]: Analyzing trace with hash 927884435, now seen corresponding path program 1 times [2022-12-14 11:14:24,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:24,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169436234] [2022-12-14 11:14:24,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:24,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:24,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:24,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169436234] [2022-12-14 11:14:24,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169436234] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:14:24,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097856609] [2022-12-14 11:14:24,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:24,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:14:24,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:14:24,928 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:14:24,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 11:14:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:24,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 11:14:25,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:14:25,055 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 11 treesize of output 7 [2022-12-14 11:14:25,060 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 11 treesize of output 7 [2022-12-14 11:14:25,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,083 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 21 treesize of output 20 [2022-12-14 11:14:25,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,089 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 21 treesize of output 20 [2022-12-14 11:14:25,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 11:14:25,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,133 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 21 treesize of output 20 [2022-12-14 11:14:25,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:14:25,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:14:25,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:14:25,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:14:25,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-12-14 11:14:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:25,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:14:25,708 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 10 treesize of output 8 [2022-12-14 11:14:25,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 12 [2022-12-14 11:14:25,720 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 10 treesize of output 8 [2022-12-14 11:14:25,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:25,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097856609] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:14:25,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1694398824] [2022-12-14 11:14:25,748 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-12-14 11:14:25,748 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:14:25,753 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:14:25,758 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:14:25,758 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:14:25,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 11:14:25,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 11:14:25,829 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 11 treesize of output 7 [2022-12-14 11:14:25,835 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 11 treesize of output 7 [2022-12-14 11:14:25,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 11:14:25,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 11:14:25,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 11:14:25,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-14 11:14:25,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 11:14:25,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:14:25,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-14 11:14:26,138 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:14:27,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1694398824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:27,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:14:27,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 5, 5] total 23 [2022-12-14 11:14:27,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921837662] [2022-12-14 11:14:27,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:27,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 11:14:27,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:27,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 11:14:27,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-12-14 11:14:27,566 INFO L87 Difference]: Start difference. First operand 169 states and 201 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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-12-14 11:14:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:28,225 INFO L93 Difference]: Finished difference Result 225 states and 260 transitions. [2022-12-14 11:14:28,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 11:14:28,226 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 11:14:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:28,227 INFO L225 Difference]: With dead ends: 225 [2022-12-14 11:14:28,227 INFO L226 Difference]: Without dead ends: 225 [2022-12-14 11:14:28,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2022-12-14 11:14:28,228 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 64 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:28,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 391 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 11:14:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-12-14 11:14:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 191. [2022-12-14 11:14:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 159 states have (on average 1.421383647798742) internal successors, (226), 190 states have internal predecessors, (226), 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-12-14 11:14:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 226 transitions. [2022-12-14 11:14:28,232 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 226 transitions. Word has length 27 [2022-12-14 11:14:28,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:28,232 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 226 transitions. [2022-12-14 11:14:28,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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-12-14 11:14:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 226 transitions. [2022-12-14 11:14:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:14:28,233 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:28,233 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] [2022-12-14 11:14:28,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:14:28,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 11:14:28,435 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1777255903, now seen corresponding path program 1 times [2022-12-14 11:14:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:28,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543895168] [2022-12-14 11:14:28,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:28,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:28,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:28,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543895168] [2022-12-14 11:14:28,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543895168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:28,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:28,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 11:14:28,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130525992] [2022-12-14 11:14:28,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:28,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 11:14:28,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:28,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 11:14:28,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:14:28,633 INFO L87 Difference]: Start difference. First operand 191 states and 226 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-12-14 11:14:28,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:28,983 INFO L93 Difference]: Finished difference Result 326 states and 367 transitions. [2022-12-14 11:14:28,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 11:14:28,983 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 28 [2022-12-14 11:14:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:28,984 INFO L225 Difference]: With dead ends: 326 [2022-12-14 11:14:28,984 INFO L226 Difference]: Without dead ends: 326 [2022-12-14 11:14:28,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-12-14 11:14:28,985 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 515 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:28,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 535 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 11:14:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-12-14 11:14:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 200. [2022-12-14 11:14:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 170 states have (on average 1.388235294117647) internal successors, (236), 199 states have internal predecessors, (236), 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-12-14 11:14:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 236 transitions. [2022-12-14 11:14:28,990 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 236 transitions. Word has length 28 [2022-12-14 11:14:28,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:28,990 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 236 transitions. [2022-12-14 11:14:28,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-12-14 11:14:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 236 transitions. [2022-12-14 11:14:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:14:28,991 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:28,991 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] [2022-12-14 11:14:28,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 11:14:28,991 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:28,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:28,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1777255902, now seen corresponding path program 1 times [2022-12-14 11:14:28,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:28,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357113655] [2022-12-14 11:14:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:28,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:29,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:29,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357113655] [2022-12-14 11:14:29,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357113655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:29,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:29,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 11:14:29,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058598941] [2022-12-14 11:14:29,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:29,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 11:14:29,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:29,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 11:14:29,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:14:29,286 INFO L87 Difference]: Start difference. First operand 200 states and 236 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-12-14 11:14:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:29,804 INFO L93 Difference]: Finished difference Result 390 states and 425 transitions. [2022-12-14 11:14:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 11:14:29,804 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 28 [2022-12-14 11:14:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:29,805 INFO L225 Difference]: With dead ends: 390 [2022-12-14 11:14:29,805 INFO L226 Difference]: Without dead ends: 390 [2022-12-14 11:14:29,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-12-14 11:14:29,806 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 567 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:29,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 672 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 11:14:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-12-14 11:14:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 206. [2022-12-14 11:14:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 176 states have (on average 1.3806818181818181) internal successors, (243), 205 states have internal predecessors, (243), 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-12-14 11:14:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 243 transitions. [2022-12-14 11:14:29,811 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 243 transitions. Word has length 28 [2022-12-14 11:14:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:29,811 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 243 transitions. [2022-12-14 11:14:29,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-12-14 11:14:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 243 transitions. [2022-12-14 11:14:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 11:14:29,812 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:29,812 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 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-12-14 11:14:29,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 11:14:29,812 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:29,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1372110719, now seen corresponding path program 1 times [2022-12-14 11:14:29,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:29,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386841781] [2022-12-14 11:14:29,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:29,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:30,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:30,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386841781] [2022-12-14 11:14:30,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386841781] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:14:30,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658231267] [2022-12-14 11:14:30,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:30,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:14:30,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:14:30,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:14:30,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 11:14:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:30,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 11:14:30,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:14:30,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:14:30,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2022-12-14 11:14:30,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:14:30,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2022-12-14 11:14:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:30,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:14:30,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658231267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:30,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:14:30,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2022-12-14 11:14:30,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144871446] [2022-12-14 11:14:30,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:30,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:14:30,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:30,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:14:30,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-12-14 11:14:30,417 INFO L87 Difference]: Start difference. First operand 206 states and 243 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-12-14 11:14:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:30,763 INFO L93 Difference]: Finished difference Result 309 states and 341 transitions. [2022-12-14 11:14:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:14:30,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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 30 [2022-12-14 11:14:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:30,764 INFO L225 Difference]: With dead ends: 309 [2022-12-14 11:14:30,764 INFO L226 Difference]: Without dead ends: 306 [2022-12-14 11:14:30,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-12-14 11:14:30,764 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 251 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:30,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 586 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 11:14:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-12-14 11:14:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 206. [2022-12-14 11:14:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 176 states have (on average 1.375) internal successors, (242), 205 states have internal predecessors, (242), 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-12-14 11:14:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 242 transitions. [2022-12-14 11:14:30,767 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 242 transitions. Word has length 30 [2022-12-14 11:14:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:30,767 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 242 transitions. [2022-12-14 11:14:30,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-12-14 11:14:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 242 transitions. [2022-12-14 11:14:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 11:14:30,767 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:30,767 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] [2022-12-14 11:14:30,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 11:14:30,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:14:30,969 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:30,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1454069089, now seen corresponding path program 1 times [2022-12-14 11:14:30,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:30,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287053603] [2022-12-14 11:14:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:30,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:31,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:31,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287053603] [2022-12-14 11:14:31,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287053603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:31,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:31,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 11:14:31,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359384449] [2022-12-14 11:14:31,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:31,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 11:14:31,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:31,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 11:14:31,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-14 11:14:31,360 INFO L87 Difference]: Start difference. First operand 206 states and 242 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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-12-14 11:14:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:31,933 INFO L93 Difference]: Finished difference Result 386 states and 420 transitions. [2022-12-14 11:14:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 11:14:31,933 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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 30 [2022-12-14 11:14:31,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:31,934 INFO L225 Difference]: With dead ends: 386 [2022-12-14 11:14:31,934 INFO L226 Difference]: Without dead ends: 386 [2022-12-14 11:14:31,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2022-12-14 11:14:31,934 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 641 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:31,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 897 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 11:14:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-12-14 11:14:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 206. [2022-12-14 11:14:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 176 states have (on average 1.3693181818181819) internal successors, (241), 205 states have internal predecessors, (241), 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-12-14 11:14:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 241 transitions. [2022-12-14 11:14:31,937 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 241 transitions. Word has length 30 [2022-12-14 11:14:31,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:31,937 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 241 transitions. [2022-12-14 11:14:31,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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-12-14 11:14:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 241 transitions. [2022-12-14 11:14:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 11:14:31,938 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:31,938 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] [2022-12-14 11:14:31,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 11:14:31,938 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:31,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:31,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1512755192, now seen corresponding path program 1 times [2022-12-14 11:14:31,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:31,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893613625] [2022-12-14 11:14:31,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:31,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:32,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:32,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893613625] [2022-12-14 11:14:32,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893613625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:32,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:32,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:14:32,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325885325] [2022-12-14 11:14:32,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:32,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:14:32,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:32,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:14:32,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:14:32,009 INFO L87 Difference]: Start difference. First operand 206 states and 241 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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-12-14 11:14:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:32,119 INFO L93 Difference]: Finished difference Result 205 states and 240 transitions. [2022-12-14 11:14:32,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:14:32,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2022-12-14 11:14:32,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:32,121 INFO L225 Difference]: With dead ends: 205 [2022-12-14 11:14:32,121 INFO L226 Difference]: Without dead ends: 205 [2022-12-14 11:14:32,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:14:32,122 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 3 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:32,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 303 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-12-14 11:14:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-12-14 11:14:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 176 states have (on average 1.3636363636363635) internal successors, (240), 204 states have internal predecessors, (240), 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-12-14 11:14:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 240 transitions. [2022-12-14 11:14:32,126 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 240 transitions. Word has length 30 [2022-12-14 11:14:32,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:32,126 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 240 transitions. [2022-12-14 11:14:32,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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-12-14 11:14:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 240 transitions. [2022-12-14 11:14:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 11:14:32,126 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:32,126 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] [2022-12-14 11:14:32,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 11:14:32,126 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:32,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1512755191, now seen corresponding path program 1 times [2022-12-14 11:14:32,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:32,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079266768] [2022-12-14 11:14:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:32,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:32,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:32,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079266768] [2022-12-14 11:14:32,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079266768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:32,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:32,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:14:32,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192200478] [2022-12-14 11:14:32,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:32,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:14:32,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:32,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:14:32,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:14:32,235 INFO L87 Difference]: Start difference. First operand 205 states and 240 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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-12-14 11:14:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:32,343 INFO L93 Difference]: Finished difference Result 204 states and 239 transitions. [2022-12-14 11:14:32,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:14:32,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2022-12-14 11:14:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:32,344 INFO L225 Difference]: With dead ends: 204 [2022-12-14 11:14:32,344 INFO L226 Difference]: Without dead ends: 204 [2022-12-14 11:14:32,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:14:32,345 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:32,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 300 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-12-14 11:14:32,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-12-14 11:14:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 176 states have (on average 1.3579545454545454) internal successors, (239), 203 states have internal predecessors, (239), 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-12-14 11:14:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 239 transitions. [2022-12-14 11:14:32,347 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 239 transitions. Word has length 30 [2022-12-14 11:14:32,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:32,348 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 239 transitions. [2022-12-14 11:14:32,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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-12-14 11:14:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 239 transitions. [2022-12-14 11:14:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 11:14:32,348 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:32,348 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 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-12-14 11:14:32,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 11:14:32,348 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:32,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1989858835, now seen corresponding path program 1 times [2022-12-14 11:14:32,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:32,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858788790] [2022-12-14 11:14:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:32,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 11:14:32,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:32,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858788790] [2022-12-14 11:14:32,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858788790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:32,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:32,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 11:14:32,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525724455] [2022-12-14 11:14:32,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:32,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 11:14:32,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:32,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 11:14:32,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:14:32,492 INFO L87 Difference]: Start difference. First operand 204 states and 239 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-12-14 11:14:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:32,669 INFO L93 Difference]: Finished difference Result 269 states and 313 transitions. [2022-12-14 11:14:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:14:32,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 31 [2022-12-14 11:14:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:32,670 INFO L225 Difference]: With dead ends: 269 [2022-12-14 11:14:32,670 INFO L226 Difference]: Without dead ends: 269 [2022-12-14 11:14:32,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-14 11:14:32,671 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 278 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:32,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 440 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-12-14 11:14:32,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 192. [2022-12-14 11:14:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 164 states have (on average 1.3719512195121952) internal successors, (225), 191 states have internal predecessors, (225), 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-12-14 11:14:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 225 transitions. [2022-12-14 11:14:32,674 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 225 transitions. Word has length 31 [2022-12-14 11:14:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:32,674 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 225 transitions. [2022-12-14 11:14:32,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-12-14 11:14:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 225 transitions. [2022-12-14 11:14:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 11:14:32,674 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:32,675 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] [2022-12-14 11:14:32,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-14 11:14:32,675 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:32,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:32,675 INFO L85 PathProgramCache]: Analyzing trace with hash -144497496, now seen corresponding path program 1 times [2022-12-14 11:14:32,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:32,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472075701] [2022-12-14 11:14:32,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:32,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:14:32,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:32,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472075701] [2022-12-14 11:14:32,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472075701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:32,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:32,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:14:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851655749] [2022-12-14 11:14:32,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:32,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:14:32,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:32,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:14:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:14:32,749 INFO L87 Difference]: Start difference. First operand 192 states and 225 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-12-14 11:14:32,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:32,865 INFO L93 Difference]: Finished difference Result 194 states and 226 transitions. [2022-12-14 11:14:32,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:14:32,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 31 [2022-12-14 11:14:32,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:32,866 INFO L225 Difference]: With dead ends: 194 [2022-12-14 11:14:32,866 INFO L226 Difference]: Without dead ends: 194 [2022-12-14 11:14:32,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-14 11:14:32,867 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 20 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:32,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 227 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-12-14 11:14:32,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-12-14 11:14:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 164 states have (on average 1.3658536585365855) internal successors, (224), 191 states have internal predecessors, (224), 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-12-14 11:14:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 224 transitions. [2022-12-14 11:14:32,869 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 224 transitions. Word has length 31 [2022-12-14 11:14:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:32,870 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 224 transitions. [2022-12-14 11:14:32,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-12-14 11:14:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 224 transitions. [2022-12-14 11:14:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 11:14:32,870 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:32,870 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] [2022-12-14 11:14:32,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-14 11:14:32,870 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:32,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:32,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1822818448, now seen corresponding path program 1 times [2022-12-14 11:14:32,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:32,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052137302] [2022-12-14 11:14:32,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:32,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:32,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:32,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052137302] [2022-12-14 11:14:32,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052137302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:32,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:32,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:14:32,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779747882] [2022-12-14 11:14:32,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:32,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:14:32,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:32,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:14:32,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:14:32,947 INFO L87 Difference]: Start difference. First operand 192 states and 224 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-12-14 11:14:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:33,032 INFO L93 Difference]: Finished difference Result 205 states and 238 transitions. [2022-12-14 11:14:33,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:14:33,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2022-12-14 11:14:33,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:33,033 INFO L225 Difference]: With dead ends: 205 [2022-12-14 11:14:33,033 INFO L226 Difference]: Without dead ends: 205 [2022-12-14 11:14:33,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-14 11:14:33,033 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 12 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:33,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 267 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:14:33,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-12-14 11:14:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2022-12-14 11:14:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 166 states have (on average 1.3614457831325302) internal successors, (226), 193 states have internal predecessors, (226), 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-12-14 11:14:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2022-12-14 11:14:33,036 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 32 [2022-12-14 11:14:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:33,036 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2022-12-14 11:14:33,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-12-14 11:14:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2022-12-14 11:14:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 11:14:33,036 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:33,037 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] [2022-12-14 11:14:33,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-14 11:14:33,037 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:33,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2058508369, now seen corresponding path program 1 times [2022-12-14 11:14:33,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:33,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337506554] [2022-12-14 11:14:33,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:33,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:33,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:33,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337506554] [2022-12-14 11:14:33,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337506554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:33,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:33,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 11:14:33,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385463803] [2022-12-14 11:14:33,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:33,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 11:14:33,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:33,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 11:14:33,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:14:33,284 INFO L87 Difference]: Start difference. First operand 194 states and 226 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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-12-14 11:14:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:33,565 INFO L93 Difference]: Finished difference Result 195 states and 226 transitions. [2022-12-14 11:14:33,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 11:14:33,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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 32 [2022-12-14 11:14:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:33,566 INFO L225 Difference]: With dead ends: 195 [2022-12-14 11:14:33,566 INFO L226 Difference]: Without dead ends: 195 [2022-12-14 11:14:33,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-12-14 11:14:33,567 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 170 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:33,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 335 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:14:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-12-14 11:14:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2022-12-14 11:14:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 166 states have (on average 1.355421686746988) internal successors, (225), 192 states have internal predecessors, (225), 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-12-14 11:14:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2022-12-14 11:14:33,570 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 32 [2022-12-14 11:14:33,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:33,570 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2022-12-14 11:14:33,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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-12-14 11:14:33,570 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2022-12-14 11:14:33,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 11:14:33,571 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:33,571 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] [2022-12-14 11:14:33,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-14 11:14:33,571 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:33,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:33,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2058508368, now seen corresponding path program 1 times [2022-12-14 11:14:33,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:33,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286276505] [2022-12-14 11:14:33,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:33,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:14:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:14:33,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:14:33,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286276505] [2022-12-14 11:14:33,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286276505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:14:33,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:14:33,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 11:14:33,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036077269] [2022-12-14 11:14:33,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:14:33,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 11:14:33,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:14:33,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 11:14:33,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:14:33,880 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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-12-14 11:14:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:14:34,209 INFO L93 Difference]: Finished difference Result 194 states and 225 transitions. [2022-12-14 11:14:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 11:14:34,210 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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 32 [2022-12-14 11:14:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:14:34,210 INFO L225 Difference]: With dead ends: 194 [2022-12-14 11:14:34,210 INFO L226 Difference]: Without dead ends: 194 [2022-12-14 11:14:34,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-12-14 11:14:34,211 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 165 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:14:34,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 330 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:14:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-12-14 11:14:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-12-14 11:14:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 191 states have internal predecessors, (224), 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-12-14 11:14:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 224 transitions. [2022-12-14 11:14:34,213 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 224 transitions. Word has length 32 [2022-12-14 11:14:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:14:34,213 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 224 transitions. [2022-12-14 11:14:34,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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-12-14 11:14:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 224 transitions. [2022-12-14 11:14:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 11:14:34,214 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:14:34,214 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] [2022-12-14 11:14:34,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-14 11:14:34,214 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-12-14 11:14:34,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:14:34,214 INFO L85 PathProgramCache]: Analyzing trace with hash -863719354, now seen corresponding path program 1 times [2022-12-14 11:14:34,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:14:34,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249468055] [2022-12-14 11:14:34,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:14:34,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:14:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 11:14:34,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 11:14:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 11:14:34,251 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 11:14:34,251 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 11:14:34,252 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK (83 of 84 remaining) [2022-12-14 11:14:34,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 84 remaining) [2022-12-14 11:14:34,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 84 remaining) [2022-12-14 11:14:34,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 84 remaining) [2022-12-14 11:14:34,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 84 remaining) [2022-12-14 11:14:34,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (78 of 84 remaining) [2022-12-14 11:14:34,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 84 remaining) [2022-12-14 11:14:34,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 84 remaining) [2022-12-14 11:14:34,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 84 remaining) [2022-12-14 11:14:34,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 84 remaining) [2022-12-14 11:14:34,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 84 remaining) [2022-12-14 11:14:34,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 84 remaining) [2022-12-14 11:14:34,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 84 remaining) [2022-12-14 11:14:34,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 84 remaining) [2022-12-14 11:14:34,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 84 remaining) [2022-12-14 11:14:34,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 84 remaining) [2022-12-14 11:14:34,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 84 remaining) [2022-12-14 11:14:34,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 84 remaining) [2022-12-14 11:14:34,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 84 remaining) [2022-12-14 11:14:34,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 84 remaining) [2022-12-14 11:14:34,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 84 remaining) [2022-12-14 11:14:34,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 84 remaining) [2022-12-14 11:14:34,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (61 of 84 remaining) [2022-12-14 11:14:34,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 84 remaining) [2022-12-14 11:14:34,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 84 remaining) [2022-12-14 11:14:34,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 84 remaining) [2022-12-14 11:14:34,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 84 remaining) [2022-12-14 11:14:34,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 84 remaining) [2022-12-14 11:14:34,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 84 remaining) [2022-12-14 11:14:34,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 84 remaining) [2022-12-14 11:14:34,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 84 remaining) [2022-12-14 11:14:34,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 84 remaining) [2022-12-14 11:14:34,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 84 remaining) [2022-12-14 11:14:34,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (50 of 84 remaining) [2022-12-14 11:14:34,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (49 of 84 remaining) [2022-12-14 11:14:34,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 84 remaining) [2022-12-14 11:14:34,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 84 remaining) [2022-12-14 11:14:34,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 84 remaining) [2022-12-14 11:14:34,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 84 remaining) [2022-12-14 11:14:34,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 84 remaining) [2022-12-14 11:14:34,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 84 remaining) [2022-12-14 11:14:34,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 84 remaining) [2022-12-14 11:14:34,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 84 remaining) [2022-12-14 11:14:34,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 84 remaining) [2022-12-14 11:14:34,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 84 remaining) [2022-12-14 11:14:34,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 84 remaining) [2022-12-14 11:14:34,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 84 remaining) [2022-12-14 11:14:34,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 84 remaining) [2022-12-14 11:14:34,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 84 remaining) [2022-12-14 11:14:34,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 84 remaining) [2022-12-14 11:14:34,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 84 remaining) [2022-12-14 11:14:34,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK (32 of 84 remaining) [2022-12-14 11:14:34,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (31 of 84 remaining) [2022-12-14 11:14:34,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 84 remaining) [2022-12-14 11:14:34,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 84 remaining) [2022-12-14 11:14:34,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (28 of 84 remaining) [2022-12-14 11:14:34,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 84 remaining) [2022-12-14 11:14:34,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 84 remaining) [2022-12-14 11:14:34,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK (25 of 84 remaining) [2022-12-14 11:14:34,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 84 remaining) [2022-12-14 11:14:34,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 84 remaining) [2022-12-14 11:14:34,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 84 remaining) [2022-12-14 11:14:34,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 84 remaining) [2022-12-14 11:14:34,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK (20 of 84 remaining) [2022-12-14 11:14:34,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 84 remaining) [2022-12-14 11:14:34,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 84 remaining) [2022-12-14 11:14:34,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 84 remaining) [2022-12-14 11:14:34,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 84 remaining) [2022-12-14 11:14:34,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK (15 of 84 remaining) [2022-12-14 11:14:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 84 remaining) [2022-12-14 11:14:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 84 remaining) [2022-12-14 11:14:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK (12 of 84 remaining) [2022-12-14 11:14:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 84 remaining) [2022-12-14 11:14:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 84 remaining) [2022-12-14 11:14:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK (9 of 84 remaining) [2022-12-14 11:14:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (8 of 84 remaining) [2022-12-14 11:14:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE (7 of 84 remaining) [2022-12-14 11:14:34,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE (6 of 84 remaining) [2022-12-14 11:14:34,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 84 remaining) [2022-12-14 11:14:34,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 84 remaining) [2022-12-14 11:14:34,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_FREE (3 of 84 remaining) [2022-12-14 11:14:34,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (2 of 84 remaining) [2022-12-14 11:14:34,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (1 of 84 remaining) [2022-12-14 11:14:34,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (0 of 84 remaining) [2022-12-14 11:14:34,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-14 11:14:34,265 INFO L445 BasicCegarLoop]: Path program 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] [2022-12-14 11:14:34,269 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 11:14:34,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:14:34 BoogieIcfgContainer [2022-12-14 11:14:34,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 11:14:34,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 11:14:34,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 11:14:34,286 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 11:14:34,287 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:14:19" (3/4) ... [2022-12-14 11:14:34,288 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 11:14:34,313 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 11:14:34,313 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 11:14:34,313 INFO L158 Benchmark]: Toolchain (without parser) took 15829.13ms. Allocated memory was 123.7MB in the beginning and 180.4MB in the end (delta: 56.6MB). Free memory was 88.2MB in the beginning and 132.5MB in the end (delta: -44.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2022-12-14 11:14:34,313 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 123.7MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:14:34,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.66ms. Allocated memory is still 123.7MB. Free memory was 87.7MB in the beginning and 68.0MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 11:14:34,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.54ms. Allocated memory is still 123.7MB. Free memory was 68.0MB in the beginning and 65.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:14:34,314 INFO L158 Benchmark]: Boogie Preprocessor took 24.18ms. Allocated memory is still 123.7MB. Free memory was 65.6MB in the beginning and 63.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:14:34,314 INFO L158 Benchmark]: RCFGBuilder took 603.51ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 63.2MB in the beginning and 99.7MB in the end (delta: -36.5MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2022-12-14 11:14:34,315 INFO L158 Benchmark]: TraceAbstraction took 14851.53ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 99.7MB in the beginning and 134.6MB in the end (delta: -34.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:14:34,315 INFO L158 Benchmark]: Witness Printer took 26.91ms. Allocated memory is still 180.4MB. Free memory was 134.6MB in the beginning and 132.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:14:34,316 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 123.7MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.66ms. Allocated memory is still 123.7MB. Free memory was 87.7MB in the beginning and 68.0MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.54ms. Allocated memory is still 123.7MB. Free memory was 68.0MB in the beginning and 65.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.18ms. Allocated memory is still 123.7MB. Free memory was 65.6MB in the beginning and 63.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 603.51ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 63.2MB in the beginning and 99.7MB in the end (delta: -36.5MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14851.53ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 99.7MB in the beginning and 134.6MB in the end (delta: -34.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 26.91ms. Allocated memory is still 180.4MB. Free memory was 134.6MB in the beginning and 132.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) VAL [list={-1:0}] [L1005] list->prev = ((void*)0) VAL [list={-1:0}] [L1006] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->next = ((void*)0) [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->inner = ((void*)0) [L1006] EXPR list->inner [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1008] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1031] EXPR end->inner [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner [L1034] COND TRUE len == 0 [L1035] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1039] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1040] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 178 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 34, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5503 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5503 mSDsluCounter, 10934 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7672 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9081 IncrementalHoareTripleChecker+Invalid, 9325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 3262 mSDtfsCounter, 9081 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 128 SyntacticMatches, 8 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=24, InterpolantAutomatonStates: 232, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 1152 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 774 NumberOfCodeBlocks, 774 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 732 ConstructedInterpolants, 15 QuantifiedInterpolants, 6593 SizeOfPredicates, 17 NumberOfNonLiveVariables, 354 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 36 InterpolantComputations, 32 PerfectInterpolantSequences, 9/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 0.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 26, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 36, TOOLS_POST_TIME: 0.3s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 36, TOOLS_QUANTIFIERELIM_TIME: 0.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 66, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 1, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 26, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 1, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 528, DAG_COMPRESSION_RETAINED_NODES: 68, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 11:14:34,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f125646-23ad-4f09-9fd2-68657fb359ef/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)