./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- 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 14:02:31,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:02:31,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:02:31,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:02:31,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:02:31,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:02:31,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:02:31,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:02:31,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:02:31,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:02:31,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:02:31,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:02:31,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:02:31,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:02:31,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:02:31,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:02:31,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:02:31,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:02:31,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:02:31,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:02:31,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:02:31,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:02:31,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:02:31,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:02:31,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:02:31,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:02:31,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:02:31,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:02:31,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:02:31,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:02:31,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:02:31,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:02:31,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:02:31,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:02:31,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:02:31,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:02:31,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:02:31,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:02:31,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:02:31,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:02:31,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:02:31,445 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 14:02:31,465 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:02:31,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:02:31,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:02:31,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:02:31,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:02:31,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:02:31,466 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:02:31,467 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:02:31,467 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:02:31,467 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:02:31,467 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:02:31,467 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:02:31,468 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:02:31,468 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:02:31,468 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:02:31,468 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:02:31,468 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:02:31,469 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:02:31,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:02:31,469 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:02:31,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:02:31,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:02:31,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:02:31,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 14:02:31,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:02:31,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 14:02:31,471 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:02:31,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 14:02:31,471 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:02:31,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 14:02:31,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:02:31,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:02:31,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:02:31,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:02:31,472 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:02:31,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:02:31,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 14:02:31,473 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:02:31,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:02:31,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 14:02:31,474 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:02:31,474 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/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 ! call(reach_error())) ) 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2022-12-14 14:02:31,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:02:31,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:02:31,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:02:31,681 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:02:31,682 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:02:31,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2022-12-14 14:02:34,230 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:02:34,437 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:02:34,438 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i [2022-12-14 14:02:34,448 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/data/d54fafffb/97570752eb704d3886b1bafd38cc2661/FLAG1e1a4ad9b [2022-12-14 14:02:34,458 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/data/d54fafffb/97570752eb704d3886b1bafd38cc2661 [2022-12-14 14:02:34,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:02:34,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:02:34,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:02:34,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:02:34,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:02:34,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:02:34" (1/1) ... [2022-12-14 14:02:34,466 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 02:02:34, skipping insertion in model container [2022-12-14 14:02:34,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:02:34" (1/1) ... [2022-12-14 14:02:34,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:02:34,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:02:34,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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2022-12-14 14:02:34,715 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2022-12-14 14:02:34,717 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2022-12-14 14:02:34,718 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2022-12-14 14:02:34,720 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2022-12-14 14:02:34,721 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2022-12-14 14:02:34,723 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2022-12-14 14:02:34,724 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2022-12-14 14:02:34,725 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2022-12-14 14:02:34,727 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2022-12-14 14:02:34,728 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2022-12-14 14:02:34,729 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2022-12-14 14:02:34,730 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2022-12-14 14:02:34,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:02:34,742 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:02:34,771 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2022-12-14 14:02:34,774 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2022-12-14 14:02:34,776 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2022-12-14 14:02:34,776 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2022-12-14 14:02:34,779 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2022-12-14 14:02:34,780 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2022-12-14 14:02:34,782 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2022-12-14 14:02:34,782 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2022-12-14 14:02:34,783 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2022-12-14 14:02:34,784 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2022-12-14 14:02:34,786 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2022-12-14 14:02:34,787 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2022-12-14 14:02:34,788 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_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2022-12-14 14:02:34,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:02:34,811 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:02:34,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:34 WrapperNode [2022-12-14 14:02:34,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:02:34,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:02:34,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:02:34,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:02:34,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:34" (1/1) ... [2022-12-14 14:02:34,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:34" (1/1) ... [2022-12-14 14:02:34,845 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 225 [2022-12-14 14:02:34,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:02:34,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:02:34,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:02:34,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:02:34,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:34" (1/1) ... [2022-12-14 14:02:34,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:34" (1/1) ... [2022-12-14 14:02:34,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:34" (1/1) ... [2022-12-14 14:02:34,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:34" (1/1) ... [2022-12-14 14:02:34,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:34" (1/1) ... [2022-12-14 14:02:34,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:34" (1/1) ... [2022-12-14 14:02:34,869 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:34" (1/1) ... [2022-12-14 14:02:34,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:34" (1/1) ... [2022-12-14 14:02:34,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:02:34,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:02:34,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:02:34,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:02:34,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:34" (1/1) ... [2022-12-14 14:02:34,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:02:34,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:34,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:02:34,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:02:34,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 14:02:34,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:02:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 14:02:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 14:02:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 14:02:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 14:02:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:02:34,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:02:35,015 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:02:35,016 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:02:35,235 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:02:35,285 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:02:35,285 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-12-14 14:02:35,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:02:35 BoogieIcfgContainer [2022-12-14 14:02:35,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:02:35,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:02:35,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:02:35,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:02:35,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:02:34" (1/3) ... [2022-12-14 14:02:35,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b86aead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:02:35, skipping insertion in model container [2022-12-14 14:02:35,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:02:34" (2/3) ... [2022-12-14 14:02:35,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b86aead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:02:35, skipping insertion in model container [2022-12-14 14:02:35,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:02:35" (3/3) ... [2022-12-14 14:02:35,302 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2022-12-14 14:02:35,325 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:02:35,325 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-12-14 14:02:35,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:02:35,367 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3fd3d8cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:02:35,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-14 14:02:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 60 states have (on average 1.9666666666666666) internal successors, (118), 73 states have internal predecessors, (118), 0 states have call successors, (0), 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 14:02:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 14:02:35,374 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:35,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 14:02:35,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:35,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:35,379 INFO L85 PathProgramCache]: Analyzing trace with hash 352944, now seen corresponding path program 1 times [2022-12-14 14:02:35,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:35,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774430873] [2022-12-14 14:02:35,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:35,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:35,514 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 14:02:35,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:35,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774430873] [2022-12-14 14:02:35,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774430873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:35,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:35,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:02:35,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046442094] [2022-12-14 14:02:35,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:35,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:02:35,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:02:35,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:02:35,545 INFO L87 Difference]: Start difference. First operand has 74 states, 60 states have (on average 1.9666666666666666) internal successors, (118), 73 states have internal predecessors, (118), 0 states have call successors, (0), 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, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:35,613 INFO L93 Difference]: Finished difference Result 163 states and 262 transitions. [2022-12-14 14:02:35,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:02:35,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 14:02:35,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:35,622 INFO L225 Difference]: With dead ends: 163 [2022-12-14 14:02:35,622 INFO L226 Difference]: Without dead ends: 89 [2022-12-14 14:02:35,624 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 14:02:35,626 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 73 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:35,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 78 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:02:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-14 14:02:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2022-12-14 14:02:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.271186440677966) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 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 14:02:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-12-14 14:02:35,654 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 3 [2022-12-14 14:02:35,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:35,655 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-12-14 14:02:35,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:02:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-12-14 14:02:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 14:02:35,656 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:35,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:35,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 14:02:35,656 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:35,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:35,657 INFO L85 PathProgramCache]: Analyzing trace with hash -334513390, now seen corresponding path program 1 times [2022-12-14 14:02:35,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:35,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192448575] [2022-12-14 14:02:35,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:35,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:35,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:35,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192448575] [2022-12-14 14:02:35,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192448575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:35,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:35,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:02:35,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914633618] [2022-12-14 14:02:35,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:35,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:02:35,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:35,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:02:35,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:02:35,926 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 14:02:35,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:35,980 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-12-14 14:02:35,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:02:35,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-12-14 14:02:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:35,981 INFO L225 Difference]: With dead ends: 71 [2022-12-14 14:02:35,981 INFO L226 Difference]: Without dead ends: 69 [2022-12-14 14:02:35,982 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 14:02:35,983 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:35,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:02:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-14 14:02:35,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-12-14 14:02:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 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 14:02:35,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-12-14 14:02:35,988 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 7 [2022-12-14 14:02:35,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:35,988 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-12-14 14:02:35,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 14:02:35,989 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-12-14 14:02:35,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 14:02:35,989 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:35,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:35,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 14:02:35,989 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:35,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1623644709, now seen corresponding path program 1 times [2022-12-14 14:02:35,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:35,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427623962] [2022-12-14 14:02:35,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:35,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:36,053 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 14:02:36,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:36,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427623962] [2022-12-14 14:02:36,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427623962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:36,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:36,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:02:36,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481095032] [2022-12-14 14:02:36,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:36,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:02:36,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:36,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:02:36,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:02:36,055 INFO L87 Difference]: Start difference. First operand 69 states and 73 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 14:02:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:36,117 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-12-14 14:02:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:02:36,118 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 14:02:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:36,119 INFO L225 Difference]: With dead ends: 72 [2022-12-14 14:02:36,119 INFO L226 Difference]: Without dead ends: 68 [2022-12-14 14:02:36,119 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 14:02:36,121 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:36,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 97 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:02:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-14 14:02:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-12-14 14:02:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 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 14:02:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-12-14 14:02:36,125 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2022-12-14 14:02:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:36,126 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-12-14 14:02:36,126 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 14:02:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-12-14 14:02:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 14:02:36,126 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:36,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:36,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 14:02:36,126 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:36,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:36,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1206617373, now seen corresponding path program 1 times [2022-12-14 14:02:36,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:36,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39590479] [2022-12-14 14:02:36,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:36,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:36,200 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 14:02:36,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:36,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39590479] [2022-12-14 14:02:36,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39590479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:36,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:36,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:02:36,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566665905] [2022-12-14 14:02:36,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:36,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:02:36,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:36,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:02:36,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:02:36,202 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 14:02:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:36,282 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2022-12-14 14:02:36,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:02:36,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 14:02:36,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:36,284 INFO L225 Difference]: With dead ends: 123 [2022-12-14 14:02:36,284 INFO L226 Difference]: Without dead ends: 103 [2022-12-14 14:02:36,285 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 14:02:36,285 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 115 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:36,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 95 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:02:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-14 14:02:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2022-12-14 14:02:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 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 14:02:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-12-14 14:02:36,290 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 13 [2022-12-14 14:02:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:36,291 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-12-14 14:02:36,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 14:02:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-12-14 14:02:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 14:02:36,291 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:36,291 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 14:02:36,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 14:02:36,292 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:36,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1497974141, now seen corresponding path program 1 times [2022-12-14 14:02:36,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:36,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866571097] [2022-12-14 14:02:36,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:36,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:36,349 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 14:02:36,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:36,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866571097] [2022-12-14 14:02:36,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866571097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:36,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:36,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:02:36,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474522305] [2022-12-14 14:02:36,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:36,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:02:36,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:36,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:02:36,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:02:36,351 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 14:02:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:36,402 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-12-14 14:02:36,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:02:36,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 14:02:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:36,404 INFO L225 Difference]: With dead ends: 89 [2022-12-14 14:02:36,404 INFO L226 Difference]: Without dead ends: 87 [2022-12-14 14:02:36,404 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 14:02:36,405 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:36,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 113 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:02:36,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-12-14 14:02:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2022-12-14 14:02:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 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 14:02:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2022-12-14 14:02:36,409 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 17 [2022-12-14 14:02:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:36,409 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2022-12-14 14:02:36,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 14:02:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-12-14 14:02:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 14:02:36,410 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:36,410 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 14:02:36,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 14:02:36,410 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1497977891, now seen corresponding path program 1 times [2022-12-14 14:02:36,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:36,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846349722] [2022-12-14 14:02:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:36,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:36,474 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 14:02:36,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:36,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846349722] [2022-12-14 14:02:36,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846349722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:36,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:36,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:02:36,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682023713] [2022-12-14 14:02:36,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:36,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:02:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:36,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:02:36,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:02:36,476 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 14:02:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:36,523 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-12-14 14:02:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:02:36,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 14:02:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:36,524 INFO L225 Difference]: With dead ends: 66 [2022-12-14 14:02:36,524 INFO L226 Difference]: Without dead ends: 64 [2022-12-14 14:02:36,525 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 14:02:36,525 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:36,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:02:36,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-14 14:02:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-12-14 14:02:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 0 states have call successors, (0), 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 14:02:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-12-14 14:02:36,529 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 17 [2022-12-14 14:02:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:36,529 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-12-14 14:02:36,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 14:02:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-12-14 14:02:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 14:02:36,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:36,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:36,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 14:02:36,530 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:36,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:36,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1754170232, now seen corresponding path program 1 times [2022-12-14 14:02:36,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:36,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712299827] [2022-12-14 14:02:36,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:36,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:36,779 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 14:02:36,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:36,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712299827] [2022-12-14 14:02:36,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712299827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:36,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:36,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:02:36,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113188005] [2022-12-14 14:02:36,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:36,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:02:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:36,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:02:36,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:02:36,781 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 14:02:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:36,831 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-12-14 14:02:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:02:36,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-12-14 14:02:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:36,832 INFO L225 Difference]: With dead ends: 64 [2022-12-14 14:02:36,832 INFO L226 Difference]: Without dead ends: 62 [2022-12-14 14:02:36,832 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 14:02:36,833 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:36,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:02:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-14 14:02:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-12-14 14:02:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 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 14:02:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-12-14 14:02:36,837 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 18 [2022-12-14 14:02:36,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:36,837 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-12-14 14:02:36,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 14:02:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-12-14 14:02:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:02:36,838 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:36,838 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] [2022-12-14 14:02:36,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 14:02:36,839 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:36,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:36,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1553239708, now seen corresponding path program 1 times [2022-12-14 14:02:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:36,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123772616] [2022-12-14 14:02:36,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:36,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:38,562 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 14:02:38,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:38,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123772616] [2022-12-14 14:02:38,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123772616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:38,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:38,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 14:02:38,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774666669] [2022-12-14 14:02:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:38,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:02:38,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:38,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:02:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-14 14:02:38,564 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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 14:02:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:39,096 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2022-12-14 14:02:39,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:02:39,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-12-14 14:02:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:39,098 INFO L225 Difference]: With dead ends: 161 [2022-12-14 14:02:39,098 INFO L226 Difference]: Without dead ends: 159 [2022-12-14 14:02:39,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-12-14 14:02:39,099 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 295 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:39,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 254 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:02:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-12-14 14:02:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 73. [2022-12-14 14:02:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 72 states have internal predecessors, (80), 0 states have call successors, (0), 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 14:02:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-12-14 14:02:39,109 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 20 [2022-12-14 14:02:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:39,109 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-12-14 14:02:39,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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 14:02:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-12-14 14:02:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 14:02:39,110 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:39,110 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 14:02:39,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 14:02:39,110 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:39,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:39,110 INFO L85 PathProgramCache]: Analyzing trace with hash 941007687, now seen corresponding path program 1 times [2022-12-14 14:02:39,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:39,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773467058] [2022-12-14 14:02:39,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:39,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:39,154 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 14:02:39,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:39,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773467058] [2022-12-14 14:02:39,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773467058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:39,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:39,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:02:39,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733916804] [2022-12-14 14:02:39,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:39,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:02:39,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:39,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:02:39,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:02:39,156 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 14:02:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:39,231 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-12-14 14:02:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:02:39,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 14:02:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:39,232 INFO L225 Difference]: With dead ends: 73 [2022-12-14 14:02:39,233 INFO L226 Difference]: Without dead ends: 71 [2022-12-14 14:02:39,233 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 14:02:39,233 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:39,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 53 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:02:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-14 14:02:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-12-14 14:02:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 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 14:02:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-12-14 14:02:39,241 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 23 [2022-12-14 14:02:39,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:39,241 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-12-14 14:02:39,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 14:02:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-12-14 14:02:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 14:02:39,242 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:39,242 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 14:02:39,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 14:02:39,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:39,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1409393835, now seen corresponding path program 1 times [2022-12-14 14:02:39,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:39,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63013828] [2022-12-14 14:02:39,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:39,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:40,904 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 14:02:40,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:40,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63013828] [2022-12-14 14:02:40,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63013828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:40,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:40,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 14:02:40,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23934225] [2022-12-14 14:02:40,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:40,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:02:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:40,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:02:40,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 14:02:40,906 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 14:02:41,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:41,457 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2022-12-14 14:02:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:02:41,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 14:02:41,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:41,459 INFO L225 Difference]: With dead ends: 153 [2022-12-14 14:02:41,459 INFO L226 Difference]: Without dead ends: 151 [2022-12-14 14:02:41,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-12-14 14:02:41,460 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 266 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:41,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 215 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:02:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-12-14 14:02:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 74. [2022-12-14 14:02:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.173913043478261) internal successors, (81), 73 states have internal predecessors, (81), 0 states have call successors, (0), 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 14:02:41,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-12-14 14:02:41,475 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 23 [2022-12-14 14:02:41,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:41,476 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-12-14 14:02:41,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 14:02:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-12-14 14:02:41,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:02:41,477 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:41,477 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] [2022-12-14 14:02:41,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 14:02:41,477 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:41,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash -957393916, now seen corresponding path program 1 times [2022-12-14 14:02:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:41,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242831624] [2022-12-14 14:02:41,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:41,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:42,827 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 14:02:42,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:42,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242831624] [2022-12-14 14:02:42,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242831624] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:02:42,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497562433] [2022-12-14 14:02:42,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:42,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:42,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:42,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:02:42,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 14:02:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:42,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 14:02:42,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:02:42,979 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 14:02:42,983 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 14:02:42,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:02:43,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:43,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 240 [2022-12-14 14:02:43,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:43,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 270 [2022-12-14 14:02:43,162 INFO L321 Elim1Store]: treesize reduction 71, result has 24.5 percent of original size [2022-12-14 14:02:43,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 300 treesize of output 375 [2022-12-14 14:02:43,183 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 220 treesize of output 216 [2022-12-14 14:02:43,197 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 216 treesize of output 212 [2022-12-14 14:02:43,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 225 [2022-12-14 14:02:43,236 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 206 treesize of output 202 [2022-12-14 14:02:43,252 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 202 treesize of output 198 [2022-12-14 14:02:43,275 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 113 treesize of output 89 [2022-12-14 14:02:43,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:02:43,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-12-14 14:02:43,416 INFO L321 Elim1Store]: treesize reduction 80, result has 13.0 percent of original size [2022-12-14 14:02:43,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 89 treesize of output 77 [2022-12-14 14:02:43,547 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-12-14 14:02:43,548 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 2 case distinctions, treesize of input 30 treesize of output 44 [2022-12-14 14:02:43,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:43,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-12-14 14:02:43,563 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 7 treesize of output 5 [2022-12-14 14:02:43,598 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 27 treesize of output 3 [2022-12-14 14:02:43,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:02:43,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:02:43,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2022-12-14 14:02:43,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:43,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-12-14 14:02:43,638 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 15 treesize of output 11 [2022-12-14 14:02:43,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 14:02:43,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:02:43,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 14:02:43,933 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 14:02:43,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:02:44,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:02:44,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 208 treesize of output 224 [2022-12-14 14:02:44,371 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 14:02:44,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497562433] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:02:44,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2060207135] [2022-12-14 14:02:44,385 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 14:02:44,386 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:02:44,388 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:02:44,392 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:02:44,393 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:02:44,419 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 14:02:44,423 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 14:02:44,436 INFO L321 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-12-14 14:02:44,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-12-14 14:02:44,463 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 14:02:44,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 14:02:44,472 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 14:02:44,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:44,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:44,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:02:44,607 INFO L321 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2022-12-14 14:02:44,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 532 treesize of output 552 [2022-12-14 14:02:44,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:44,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:44,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:02:44,674 INFO L321 Elim1Store]: treesize reduction 30, result has 41.2 percent of original size [2022-12-14 14:02:44,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 207 treesize of output 230 [2022-12-14 14:02:44,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 179 [2022-12-14 14:02:44,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-12-14 14:02:44,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-12-14 14:02:44,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:44,863 INFO L321 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2022-12-14 14:02:44,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 67 [2022-12-14 14:02:44,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:44,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:02:44,956 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 49 treesize of output 38 [2022-12-14 14:02:44,966 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 13 treesize of output 9 [2022-12-14 14:02:45,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:45,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 22 [2022-12-14 14:02:45,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:45,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-12-14 14:02:45,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 20 [2022-12-14 14:02:45,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-12-14 14:02:45,094 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-12-14 14:02:45,094 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 70 [2022-12-14 14:02:45,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:45,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-12-14 14:02:45,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:45,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:02:45,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-12-14 14:02:45,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2022-12-14 14:02:46,122 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:02:46,579 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse30 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse2 (select .cse30 .cse18)) (.cse5 (select .cse31 .cse18))) (and (< 0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= |c_#NULL.offset| 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 1)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 2)) (let ((.cse1 (= |c_ULTIMATE.start_main_#t~mem6#1.base| 0)) (.cse0 (= |c_ULTIMATE.start_main_#t~mem6#1.offset| 0))) (or (and (or (not .cse0) (not .cse1)) |c_ULTIMATE.start_main_#t~short8#1|) (and (= .cse2 |c_ULTIMATE.start_main_#t~mem7#1.offset|) .cse1 .cse0 (let ((.cse3 (= |c_ULTIMATE.start_main_#t~mem7#1.base| 0)) (.cse4 (= |c_ULTIMATE.start_main_#t~mem7#1.offset| 0))) (or (and (or (not .cse3) (not .cse4)) (not |c_ULTIMATE.start_main_#t~short8#1|)) (and .cse3 |c_ULTIMATE.start_main_#t~short8#1| .cse4))) (= |c_ULTIMATE.start_main_#t~mem7#1.base| .cse5)))) (= |c_#NULL.base| 0) (= |c_ULTIMATE.start_main_#t~mem6#1.base| .cse5) (< |c_ULTIMATE.start_main_~list~0#1.base| |c_#StackHeapBarrier|) (= .cse2 |c_ULTIMATE.start_main_#t~mem6#1.offset|) (let ((.cse29 (select |c_#memory_int| 1))) (let ((.cse10 (select .cse29 1)) (.cse25 (select .cse31 |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse19 (select .cse30 |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse6 (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse7 (= .cse19 0)) (.cse8 (= (select |c_#valid| 0) 0)) (.cse11 (= .cse25 0)) (.cse12 (= 2 (select |c_#length| 1))) (.cse13 (= (select |c_#valid| 1) 1)) (.cse14 (= (select |c_#length| 2) 11)) (.cse15 (= (select |c_#valid| 2) 1)) (.cse16 (= .cse10 0)) (.cse20 (= 0 .cse5)) (.cse21 (= (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|) 8)) (.cse22 (= 48 (select .cse29 0))) (.cse23 (= .cse2 0))) (or (and .cse6 .cse7 .cse8 (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_12) 1))) (and (= (select .cse9 1) .cse10) (= (select .cse9 0) 48)))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (exists ((v_arrayElimCell_60 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_9) v_arrayElimCell_60 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select v_DerPreprocessor_10 4) 0) (= (select .cse17 .cse18) 0) (= (select .cse17 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse19) (= (select v_DerPreprocessor_10 0) 0) (= .cse17 v_DerPreprocessor_9)))) .cse20 .cse21 .cse22 .cse23) (let ((.cse27 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse24 (select |c_#memory_$Pointer$.base| .cse5))) (and (not (= 2 .cse5)) .cse6 (not (= 1 .cse5)) .cse7 .cse8 (< .cse5 |c_#StackHeapBarrier|) (= (select .cse24 4) 0) .cse12 .cse13 .cse14 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse26 (select v_DerPreprocessor_6 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= .cse25 .cse26) (= .cse26 0) (= v_DerPreprocessor_7 (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_6) .cse5 v_DerPreprocessor_7) |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_6) .cse5)) (= (select v_DerPreprocessor_6 .cse18) 0)))) (= (select .cse27 0) 0) .cse15 (= (select .cse27 4) 0) .cse16 .cse21 .cse22 (not .cse20) .cse23 (= (select |c_#valid| .cse5) 1) (= (select .cse24 0) 0) (= (select |c_#length| .cse5) 8))) (and .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) 1))) (and (= .cse10 (select .cse28 1)) (= (select .cse28 0) 48)))) .cse20 .cse21 .cse22 .cse23)))))))) is different from true [2022-12-14 14:02:46,587 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= |c_#NULL.offset| 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 1)) (= |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 2)) (= |c_#NULL.base| 0) (< |c_ULTIMATE.start_main_~list~0#1.base| |c_#StackHeapBarrier|) (let ((.cse24 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse25 (select |c_#memory_int| 1)) (.cse26 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse18 (select .cse26 .cse12)) (.cse4 (select .cse25 1)) (.cse20 (select .cse26 |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse13 (select .cse24 |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse1 (= .cse13 0)) (.cse2 (= (select |c_#valid| 0) 0)) (.cse5 (= .cse20 0)) (.cse6 (= 2 (select |c_#length| 1))) (.cse7 (= (select |c_#valid| 1) 1)) (.cse8 (= (select |c_#length| 2) 11)) (.cse9 (= (select |c_#valid| 2) 1)) (.cse10 (= .cse4 0)) (.cse14 (= 0 .cse18)) (.cse15 (= (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|) 8)) (.cse16 (= 48 (select .cse25 0))) (.cse17 (= (select .cse24 .cse12) 0))) (or (and .cse0 .cse1 .cse2 (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_12) 1))) (and (= (select .cse3 1) .cse4) (= (select .cse3 0) 48)))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((v_arrayElimCell_60 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_9) v_arrayElimCell_60 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select v_DerPreprocessor_10 4) 0) (= (select .cse11 .cse12) 0) (= (select .cse11 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse13) (= (select v_DerPreprocessor_10 0) 0) (= .cse11 v_DerPreprocessor_9)))) .cse14 .cse15 .cse16 .cse17) (let ((.cse22 (select |c_#memory_$Pointer$.offset| .cse18)) (.cse19 (select |c_#memory_$Pointer$.base| .cse18))) (and (not (= 2 .cse18)) .cse0 (not (= 1 .cse18)) .cse1 .cse2 (< .cse18 |c_#StackHeapBarrier|) (= (select .cse19 4) 0) .cse6 .cse7 .cse8 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse21 (select v_DerPreprocessor_6 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= .cse20 .cse21) (= .cse21 0) (= v_DerPreprocessor_7 (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_6) .cse18 v_DerPreprocessor_7) |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_6) .cse18)) (= (select v_DerPreprocessor_6 .cse12) 0)))) (= (select .cse22 0) 0) .cse9 (= (select .cse22 4) 0) .cse10 .cse15 .cse16 (not .cse14) .cse17 (= (select |c_#valid| .cse18) 1) (= (select .cse19 0) 0) (= (select |c_#length| .cse18) 8))) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) 1))) (and (= .cse4 (select .cse23 1)) (= (select .cse23 0) 48)))) .cse14 .cse15 .cse16 .cse17))))) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) is different from true [2022-12-14 14:02:46,593 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= |c_#NULL.offset| 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 1)) (= |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 2)) (= |c_#NULL.base| 0) (< |c_ULTIMATE.start_main_~list~0#1.base| |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_main_#t~nondet9#1| 2147483647) (let ((.cse24 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse25 (select |c_#memory_int| 1)) (.cse26 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse18 (select .cse26 .cse12)) (.cse4 (select .cse25 1)) (.cse20 (select .cse26 |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse13 (select .cse24 |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse1 (= .cse13 0)) (.cse2 (= (select |c_#valid| 0) 0)) (.cse5 (= .cse20 0)) (.cse6 (= 2 (select |c_#length| 1))) (.cse7 (= (select |c_#valid| 1) 1)) (.cse8 (= (select |c_#length| 2) 11)) (.cse9 (= (select |c_#valid| 2) 1)) (.cse10 (= .cse4 0)) (.cse14 (= 0 .cse18)) (.cse15 (= (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|) 8)) (.cse16 (= 48 (select .cse25 0))) (.cse17 (= (select .cse24 .cse12) 0))) (or (and .cse0 .cse1 .cse2 (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_12) 1))) (and (= (select .cse3 1) .cse4) (= (select .cse3 0) 48)))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((v_arrayElimCell_60 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_9) v_arrayElimCell_60 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select v_DerPreprocessor_10 4) 0) (= (select .cse11 .cse12) 0) (= (select .cse11 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse13) (= (select v_DerPreprocessor_10 0) 0) (= .cse11 v_DerPreprocessor_9)))) .cse14 .cse15 .cse16 .cse17) (let ((.cse22 (select |c_#memory_$Pointer$.offset| .cse18)) (.cse19 (select |c_#memory_$Pointer$.base| .cse18))) (and (not (= 2 .cse18)) .cse0 (not (= 1 .cse18)) .cse1 .cse2 (< .cse18 |c_#StackHeapBarrier|) (= (select .cse19 4) 0) .cse6 .cse7 .cse8 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse21 (select v_DerPreprocessor_6 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= .cse20 .cse21) (= .cse21 0) (= v_DerPreprocessor_7 (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_6) .cse18 v_DerPreprocessor_7) |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_6) .cse18)) (= (select v_DerPreprocessor_6 .cse12) 0)))) (= (select .cse22 0) 0) .cse9 (= (select .cse22 4) 0) .cse10 .cse15 .cse16 (not .cse14) .cse17 (= (select |c_#valid| .cse18) 1) (= (select .cse19 0) 0) (= (select |c_#length| .cse18) 8))) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) 1))) (and (= .cse4 (select .cse23 1)) (= (select .cse23 0) 48)))) .cse14 .cse15 .cse16 .cse17))))) (<= 0 (+ |c_ULTIMATE.start_main_#t~nondet9#1| 2147483648)) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) is different from true [2022-12-14 14:02:47,142 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2529#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 4)) 0))) (= |ULTIMATE.start_main_~inner~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= |ULTIMATE.start_main_~inner~0#1.offset| 0)) (not (= |ULTIMATE.start_main_~inner~0#1.base| 0))) (or (not (= |ULTIMATE.start_main_~end~0#1.offset| 0)) (not (= |ULTIMATE.start_main_~end~0#1.base| 0))) (= |ULTIMATE.start_main_~len~0#1| 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) |ULTIMATE.start_main_~inner~0#1.base|) (= |#NULL.base| 0))' at error location [2022-12-14 14:02:47,142 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:02:47,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:02:47,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2022-12-14 14:02:47,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405953351] [2022-12-14 14:02:47,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:02:47,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:02:47,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:47,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:02:47,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=12, NotChecked=132, Total=650 [2022-12-14 14:02:47,144 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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 14:02:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:47,646 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2022-12-14 14:02:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 14:02:47,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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 14:02:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:47,647 INFO L225 Difference]: With dead ends: 155 [2022-12-14 14:02:47,647 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 14:02:47,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=12, NotChecked=168, Total=992 [2022-12-14 14:02:47,648 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 197 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:47,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 352 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:02:47,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 14:02:47,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2022-12-14 14:02:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 88 states have internal predecessors, (100), 0 states have call successors, (0), 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 14:02:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2022-12-14 14:02:47,659 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 25 [2022-12-14 14:02:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:47,659 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2022-12-14 14:02:47,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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 14:02:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2022-12-14 14:02:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 14:02:47,659 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:47,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, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:47,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 14:02:47,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 14:02:47,862 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:47,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:47,863 INFO L85 PathProgramCache]: Analyzing trace with hash 312652120, now seen corresponding path program 1 times [2022-12-14 14:02:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:47,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598718599] [2022-12-14 14:02:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:47,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:48,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:48,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598718599] [2022-12-14 14:02:48,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598718599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:02:48,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:02:48,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 14:02:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507923767] [2022-12-14 14:02:48,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:02:48,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:02:48,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:48,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:02:48,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 14:02:48,331 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 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 14:02:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:48,607 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2022-12-14 14:02:48,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 14:02:48,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 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 26 [2022-12-14 14:02:48,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:48,608 INFO L225 Difference]: With dead ends: 185 [2022-12-14 14:02:48,608 INFO L226 Difference]: Without dead ends: 169 [2022-12-14 14:02:48,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-12-14 14:02:48,609 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 239 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:48,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 232 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:02:48,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-12-14 14:02:48,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 111. [2022-12-14 14:02:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 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 14:02:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2022-12-14 14:02:48,624 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 26 [2022-12-14 14:02:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:48,624 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2022-12-14 14:02:48,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 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 14:02:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2022-12-14 14:02:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:02:48,625 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:48,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:48,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 14:02:48,625 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:48,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1948434121, now seen corresponding path program 1 times [2022-12-14 14:02:48,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:48,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189739141] [2022-12-14 14:02:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:48,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:48,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189739141] [2022-12-14 14:02:48,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189739141] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:02:48,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558464844] [2022-12-14 14:02:48,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:48,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:48,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:48,677 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:02:48,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 14:02:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:48,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 14:02:48,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:02:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:48,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:02:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:48,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558464844] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:02:48,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1531436755] [2022-12-14 14:02:48,834 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 14:02:48,834 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:02:48,835 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:02:48,835 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:02:48,835 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:02:48,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:02:48,873 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-14 14:02:48,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-12-14 14:02:48,879 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 14:02:48,892 INFO L321 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-12-14 14:02:48,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-12-14 14:02:48,918 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 14:02:48,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 14:02:48,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 683 treesize of output 709 [2022-12-14 14:02:48,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:48,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,070 INFO L321 Elim1Store]: treesize reduction 332, result has 7.8 percent of original size [2022-12-14 14:02:49,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 340 treesize of output 363 [2022-12-14 14:02:49,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:02:49,122 INFO L321 Elim1Store]: treesize reduction 34, result has 33.3 percent of original size [2022-12-14 14:02:49,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 176 [2022-12-14 14:02:49,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-12-14 14:02:49,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-12-14 14:02:49,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:02:49,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 17 [2022-12-14 14:02:49,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-12-14 14:02:49,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2022-12-14 14:02:49,395 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 42 treesize of output 33 [2022-12-14 14:02:49,403 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 13 treesize of output 9 [2022-12-14 14:02:49,443 INFO L321 Elim1Store]: treesize reduction 32, result has 11.1 percent of original size [2022-12-14 14:02:49,444 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 70 [2022-12-14 14:02:49,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 35 [2022-12-14 14:02:49,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2022-12-14 14:02:49,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2022-12-14 14:02:49,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:02:49,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-12-14 14:02:49,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:49,556 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 51 treesize of output 34 [2022-12-14 14:02:50,627 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:02:51,901 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3467#(and (< 1 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~list~0#1.offset|) (<= |#NULL.base| 0) (= |ULTIMATE.start_main_~inner~0#1.base| 0) (<= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~end~0#1.offset|))' at error location [2022-12-14 14:02:51,902 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:02:51,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:02:51,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-12-14 14:02:51,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186808713] [2022-12-14 14:02:51,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:02:51,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:02:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:51,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:02:51,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=276, Unknown=4, NotChecked=0, Total=342 [2022-12-14 14:02:51,903 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 14:02:51,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:51,976 INFO L93 Difference]: Finished difference Result 194 states and 225 transitions. [2022-12-14 14:02:51,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:02:51,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 14:02:51,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:51,978 INFO L225 Difference]: With dead ends: 194 [2022-12-14 14:02:51,978 INFO L226 Difference]: Without dead ends: 192 [2022-12-14 14:02:51,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=62, Invalid=276, Unknown=4, NotChecked=0, Total=342 [2022-12-14 14:02:51,979 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:51,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 178 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:02:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-12-14 14:02:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 135. [2022-12-14 14:02:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.2307692307692308) internal successors, (160), 134 states have internal predecessors, (160), 0 states have call successors, (0), 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 14:02:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 160 transitions. [2022-12-14 14:02:52,017 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 160 transitions. Word has length 27 [2022-12-14 14:02:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:52,017 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 160 transitions. [2022-12-14 14:02:52,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 14:02:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2022-12-14 14:02:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 14:02:52,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:52,018 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] [2022-12-14 14:02:52,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 14:02:52,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:52,220 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:52,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:52,221 INFO L85 PathProgramCache]: Analyzing trace with hash -533962381, now seen corresponding path program 1 times [2022-12-14 14:02:52,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:52,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147386115] [2022-12-14 14:02:52,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:52,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:52,383 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:02:52,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147386115] [2022-12-14 14:02:52,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147386115] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:02:52,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17934024] [2022-12-14 14:02:52,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:52,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:02:52,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:02:52,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:02:52,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 14:02:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:02:52,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 14:02:52,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:02:52,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 14:02:52,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 14:02:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:52,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:02:52,638 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 14:02:52,638 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 24 treesize of output 23 [2022-12-14 14:02:52,645 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 14:02:52,645 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 20 treesize of output 12 [2022-12-14 14:02:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:02:52,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17934024] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:02:52,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1144195952] [2022-12-14 14:02:52,669 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 14:02:52,670 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:02:52,670 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:02:52,670 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:02:52,670 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:02:52,681 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 14:02:52,683 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 14:02:52,701 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-14 14:02:52,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-12-14 14:02:52,723 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 14:02:52,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 14:02:52,730 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 21 [2022-12-14 14:02:52,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:52,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:52,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:02:52,842 INFO L321 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2022-12-14 14:02:52,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 532 treesize of output 552 [2022-12-14 14:02:52,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 397 treesize of output 423 [2022-12-14 14:02:52,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:52,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:52,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:02:52,901 INFO L321 Elim1Store]: treesize reduction 30, result has 41.2 percent of original size [2022-12-14 14:02:52,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 193 [2022-12-14 14:02:52,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-12-14 14:02:52,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-12-14 14:02:52,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:53,027 INFO L321 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2022-12-14 14:02:53,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 67 [2022-12-14 14:02:53,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:53,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:02:53,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:53,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:53,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 17 [2022-12-14 14:02:53,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:53,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-12-14 14:02:53,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:53,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 17 [2022-12-14 14:02:53,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:53,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-12-14 14:02:53,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2022-12-14 14:02:53,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:53,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:02:53,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-12-14 14:02:53,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:02:53,328 INFO L321 Elim1Store]: treesize reduction 96, result has 10.3 percent of original size [2022-12-14 14:02:53,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 676 treesize of output 696 [2022-12-14 14:02:53,340 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 625 treesize of output 621 [2022-12-14 14:02:53,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 27 [2022-12-14 14:02:53,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 27 [2022-12-14 14:02:54,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 14:02:54,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:02:54,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:02:54,070 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:02:55,952 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4117#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))) (or (not (= |ULTIMATE.start_main_~end~0#1.offset| 0)) (not (= |ULTIMATE.start_main_~end~0#1.base| 0))) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:02:55,952 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:02:55,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:02:55,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-14 14:02:55,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907838539] [2022-12-14 14:02:55,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:02:55,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:02:55,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:02:55,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:02:55,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=553, Unknown=9, NotChecked=0, Total=702 [2022-12-14 14:02:55,954 INFO L87 Difference]: Start difference. First operand 135 states and 160 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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 14:02:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:02:56,251 INFO L93 Difference]: Finished difference Result 283 states and 327 transitions. [2022-12-14 14:02:56,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:02:56,252 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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 29 [2022-12-14 14:02:56,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:02:56,252 INFO L225 Difference]: With dead ends: 283 [2022-12-14 14:02:56,253 INFO L226 Difference]: Without dead ends: 257 [2022-12-14 14:02:56,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=195, Invalid=788, Unknown=9, NotChecked=0, Total=992 [2022-12-14 14:02:56,254 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 414 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:02:56,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 234 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:02:56,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-12-14 14:02:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 169. [2022-12-14 14:02:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.2317073170731707) internal successors, (202), 168 states have internal predecessors, (202), 0 states have call successors, (0), 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 14:02:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2022-12-14 14:02:56,286 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 29 [2022-12-14 14:02:56,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:02:56,286 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2022-12-14 14:02:56,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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 14:02:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2022-12-14 14:02:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 14:02:56,287 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:02:56,287 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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 14:02:56,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 14:02:56,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 14:02:56,488 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-12-14 14:02:56,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:02:56,489 INFO L85 PathProgramCache]: Analyzing trace with hash 797917346, now seen corresponding path program 1 times [2022-12-14 14:02:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:02:56,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813073984] [2022-12-14 14:02:56,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:02:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:02:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 14:02:56,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 14:02:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 14:02:56,594 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 14:02:56,595 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 14:02:56,595 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2022-12-14 14:02:56,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2022-12-14 14:02:56,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2022-12-14 14:02:56,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2022-12-14 14:02:56,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2022-12-14 14:02:56,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2022-12-14 14:02:56,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2022-12-14 14:02:56,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2022-12-14 14:02:56,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2022-12-14 14:02:56,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2022-12-14 14:02:56,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2022-12-14 14:02:56,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2022-12-14 14:02:56,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2022-12-14 14:02:56,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 14:02:56,602 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:02:56,606 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 14:02:56,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 02:02:56 BoogieIcfgContainer [2022-12-14 14:02:56,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 14:02:56,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 14:02:56,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 14:02:56,636 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 14:02:56,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:02:35" (3/4) ... [2022-12-14 14:02:56,638 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 14:02:56,674 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 14:02:56,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 14:02:56,675 INFO L158 Benchmark]: Toolchain (without parser) took 22214.03ms. Allocated memory was 134.2MB in the beginning and 408.9MB in the end (delta: 274.7MB). Free memory was 102.2MB in the beginning and 274.0MB in the end (delta: -171.7MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. [2022-12-14 14:02:56,675 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 134.2MB. Free memory was 109.1MB in the beginning and 109.1MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 14:02:56,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.76ms. Allocated memory is still 134.2MB. Free memory was 102.2MB in the beginning and 82.7MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 14:02:56,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.22ms. Allocated memory is still 134.2MB. Free memory was 82.0MB in the beginning and 79.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 14:02:56,676 INFO L158 Benchmark]: Boogie Preprocessor took 26.91ms. Allocated memory is still 134.2MB. Free memory was 79.9MB in the beginning and 77.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 14:02:56,676 INFO L158 Benchmark]: RCFGBuilder took 413.89ms. Allocated memory is still 134.2MB. Free memory was 77.8MB in the beginning and 49.3MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 14:02:56,676 INFO L158 Benchmark]: TraceAbstraction took 21338.92ms. Allocated memory was 134.2MB in the beginning and 408.9MB in the end (delta: 274.7MB). Free memory was 103.2MB in the beginning and 277.1MB in the end (delta: -173.9MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. [2022-12-14 14:02:56,677 INFO L158 Benchmark]: Witness Printer took 38.58ms. Allocated memory is still 408.9MB. Free memory was 277.1MB in the beginning and 274.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 14:02:56,678 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.17ms. Allocated memory is still 134.2MB. Free memory was 109.1MB in the beginning and 109.1MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.76ms. Allocated memory is still 134.2MB. Free memory was 102.2MB in the beginning and 82.7MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.22ms. Allocated memory is still 134.2MB. Free memory was 82.0MB in the beginning and 79.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.91ms. Allocated memory is still 134.2MB. Free memory was 79.9MB in the beginning and 77.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 413.89ms. Allocated memory is still 134.2MB. Free memory was 77.8MB in the beginning and 49.3MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 21338.92ms. Allocated memory was 134.2MB in the beginning and 408.9MB in the end (delta: 274.7MB). Free memory was 103.2MB in the beginning and 277.1MB in the end (delta: -173.9MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. * Witness Printer took 38.58ms. Allocated memory is still 408.9MB. Free memory was 277.1MB in the beginning and 274.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. 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: 1036]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) VAL [list={6:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={6:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner [L1004] list->inner->inner = ((void*)0) [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={6:0}, list->inner={7:0}, list->inner={0:0}, list->inner={60:63}, list->inner={53:61}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={55:51}] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={6:0}, list={6:0}, list->inner={60:63}, list->inner={53:61}, malloc(sizeof(SLL))={55:51}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={6:0}, list={6:0}, list->inner={60:63}, list->inner={53:61}, malloc(sizeof(SLL))={55:51}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={6:0}, list={6:0}, list->inner={60:63}, list->inner={53:61}, malloc(sizeof(SLL))={55:51}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={6:0}, inner={7:0}, len=1, list={6:0}, list->inner={60:63}, list->inner={53:61}, malloc(sizeof(SLL))={55:51}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={6:0}, inner={7:0}, len=1, list={6:0}, list->inner={60:63}, list->inner={53:61}, malloc(sizeof(SLL))={55:51}] [L1036] EXPR inner->inner VAL [end={6:0}, inner={7:0}, inner->inner={0:0}, len=1, list={6:0}, list->inner={60:63}, list->inner={53:61}, malloc(sizeof(SLL))={55:51}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={6:0}, inner={7:0}, inner->next={0:0}, len=1, list={6:0}, list->inner={60:63}, list->inner={53:61}, malloc(sizeof(SLL))={55:51}] [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 [L1040] EXPR inner->inner [L1040] inner = inner->inner [L1029] COND TRUE ((void*)0) != inner [L1031] COND FALSE !(len == 0) [L1034] len = 2 VAL [end={6:0}, inner={49:5}, inner->inner={52:50}, len=2, list={6:0}, list->inner={60:63}, list->inner={53:61}, malloc(sizeof(SLL))={55:51}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={6:0}, inner={49:5}, inner->inner={52:50}, len=2, list={6:0}, list->inner={60:63}, list->inner={53:61}, malloc(sizeof(SLL))={55:51}] [L1036] EXPR inner->inner VAL [end={6:0}, inner={49:5}, inner->inner={52:50}, inner->inner={58:56}, len=2, list={6:0}, list->inner={60:63}, list->inner={53:61}, malloc(sizeof(SLL))={55:51}] [L1036] COND TRUE !(((void*)0) == inner->inner) [L1036] reach_error() VAL [end={6:0}, inner={49:5}, inner->inner={52:50}, len=2, list={6:0}, list->inner={60:63}, list->inner={53:61}, malloc(sizeof(SLL))={55:51}] - UnprovableResult [Line: 1004]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 74 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 21.3s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1781 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1781 mSDsluCounter, 2229 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1478 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1090 IncrementalHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 751 mSDtfsCounter, 1090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=14, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 475 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 402 ConstructedInterpolants, 3 QuantifiedInterpolants, 4834 SizeOfPredicates, 34 NumberOfNonLiveVariables, 803 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 8/20 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: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 14:02:56,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5e1a6b7-86e7-46ed-9ee3-49bbf4163e73/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