./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- 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-5e519f3 [2022-11-03 03:43:13,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:43:13,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:43:13,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:43:13,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:43:13,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:43:13,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:43:13,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:43:13,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:43:13,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:43:13,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:43:13,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:43:13,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:43:13,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:43:13,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:43:13,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:43:13,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:43:13,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:43:13,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:43:13,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:43:13,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:43:13,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:43:13,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:43:13,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:43:13,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:43:13,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:43:13,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:43:13,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:43:13,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:43:13,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:43:13,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:43:13,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:43:13,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:43:13,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:43:13,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:43:13,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:43:13,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:43:13,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:43:13,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:43:13,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:43:13,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:43:13,459 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 03:43:13,502 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:43:13,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:43:13,503 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:43:13,504 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:43:13,505 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:43:13,505 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:43:13,506 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:43:13,506 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:43:13,506 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:43:13,506 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:43:13,508 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:43:13,508 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:43:13,508 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:43:13,509 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:43:13,509 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:43:13,509 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:43:13,510 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:43:13,510 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:43:13,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 03:43:13,511 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 03:43:13,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:43:13,512 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:43:13,512 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:43:13,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:43:13,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:43:13,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:43:13,513 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 03:43:13,514 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 03:43:13,514 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 03:43:13,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:43:13,515 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 03:43:13,515 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:43:13,515 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:43:13,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:43:13,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:43:13,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:43:13,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:43:13,517 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:43:13,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:43:13,518 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:43:13,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:43:13,518 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:43:13,518 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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2022-11-03 03:43:13,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:43:14,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:43:14,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:43:14,033 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:43:14,034 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:43:14,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2022-11-03 03:43:14,111 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/data/b4b4dc153/8ef7730e82214138a08a20f4e0b1f4bc/FLAG6eabdf353 [2022-11-03 03:43:14,799 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:43:14,805 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2022-11-03 03:43:14,825 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/data/b4b4dc153/8ef7730e82214138a08a20f4e0b1f4bc/FLAG6eabdf353 [2022-11-03 03:43:15,067 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/data/b4b4dc153/8ef7730e82214138a08a20f4e0b1f4bc [2022-11-03 03:43:15,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:43:15,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:43:15,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:43:15,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:43:15,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:43:15,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:43:15" (1/1) ... [2022-11-03 03:43:15,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a36fc6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15, skipping insertion in model container [2022-11-03 03:43:15,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:43:15" (1/1) ... [2022-11-03 03:43:15,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:43:15,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:43:15,609 WARN L230 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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2022-11-03 03:43:15,618 WARN L230 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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2022-11-03 03:43:15,624 WARN L230 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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2022-11-03 03:43:15,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:43:15,654 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:43:15,703 WARN L230 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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2022-11-03 03:43:15,704 WARN L230 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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2022-11-03 03:43:15,707 WARN L230 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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2022-11-03 03:43:15,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:43:15,741 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:43:15,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15 WrapperNode [2022-11-03 03:43:15,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:43:15,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:43:15,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:43:15,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:43:15,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15" (1/1) ... [2022-11-03 03:43:15,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15" (1/1) ... [2022-11-03 03:43:15,798 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 128 [2022-11-03 03:43:15,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:43:15,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:43:15,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:43:15,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:43:15,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15" (1/1) ... [2022-11-03 03:43:15,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15" (1/1) ... [2022-11-03 03:43:15,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15" (1/1) ... [2022-11-03 03:43:15,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15" (1/1) ... [2022-11-03 03:43:15,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15" (1/1) ... [2022-11-03 03:43:15,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15" (1/1) ... [2022-11-03 03:43:15,833 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15" (1/1) ... [2022-11-03 03:43:15,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15" (1/1) ... [2022-11-03 03:43:15,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:43:15,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:43:15,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:43:15,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:43:15,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15" (1/1) ... [2022-11-03 03:43:15,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:43:15,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:15,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:43:15,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:43:15,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:43:15,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:43:15,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:43:15,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:43:15,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 03:43:15,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 03:43:15,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:43:15,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:43:15,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:43:15,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:43:16,098 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:43:16,102 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:43:16,731 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:43:16,837 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:43:16,838 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-03 03:43:16,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:43:16 BoogieIcfgContainer [2022-11-03 03:43:16,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:43:16,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:43:16,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:43:16,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:43:16,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:43:15" (1/3) ... [2022-11-03 03:43:16,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39221d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:43:16, skipping insertion in model container [2022-11-03 03:43:16,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:15" (2/3) ... [2022-11-03 03:43:16,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39221d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:43:16, skipping insertion in model container [2022-11-03 03:43:16,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:43:16" (3/3) ... [2022-11-03 03:43:16,854 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2022-11-03 03:43:16,879 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:43:16,880 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2022-11-03 03:43:16,968 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:43:16,980 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6eec547f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:43:16,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-11-03 03:43:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 54 states have (on average 2.5) internal successors, (135), 119 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:17,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 03:43:17,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:17,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 03:43:17,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:17,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:17,016 INFO L85 PathProgramCache]: Analyzing trace with hash 8095, now seen corresponding path program 1 times [2022-11-03 03:43:17,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:17,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204384707] [2022-11-03 03:43:17,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:17,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:17,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:17,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204384707] [2022-11-03 03:43:17,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204384707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:17,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:17,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:43:17,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028461185] [2022-11-03 03:43:17,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:17,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:43:17,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:17,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:43:17,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:43:17,435 INFO L87 Difference]: Start difference. First operand has 120 states, 54 states have (on average 2.5) internal successors, (135), 119 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:17,679 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-11-03 03:43:17,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:43:17,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-03 03:43:17,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:17,694 INFO L225 Difference]: With dead ends: 119 [2022-11-03 03:43:17,694 INFO L226 Difference]: Without dead ends: 117 [2022-11-03 03:43:17,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:43:17,701 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:17,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 58 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:43:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-03 03:43:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2022-11-03 03:43:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 113 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2022-11-03 03:43:17,757 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 2 [2022-11-03 03:43:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:17,758 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2022-11-03 03:43:17,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:17,759 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2022-11-03 03:43:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 03:43:17,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:17,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 03:43:17,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:43:17,760 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:17,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:17,761 INFO L85 PathProgramCache]: Analyzing trace with hash 8096, now seen corresponding path program 1 times [2022-11-03 03:43:17,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:17,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669562706] [2022-11-03 03:43:17,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:17,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:17,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:17,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669562706] [2022-11-03 03:43:17,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669562706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:17,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:17,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:43:17,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177144871] [2022-11-03 03:43:17,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:17,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:43:17,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:17,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:43:17,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:43:17,945 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:18,122 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2022-11-03 03:43:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:43:18,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-03 03:43:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:18,125 INFO L225 Difference]: With dead ends: 127 [2022-11-03 03:43:18,125 INFO L226 Difference]: Without dead ends: 127 [2022-11-03 03:43:18,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:43:18,127 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 97 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:18,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 64 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:43:18,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-03 03:43:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2022-11-03 03:43:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 115 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2022-11-03 03:43:18,153 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2022-11-03 03:43:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:18,153 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2022-11-03 03:43:18,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-11-03 03:43:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:43:18,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:18,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:18,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:43:18,156 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:18,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash -191356527, now seen corresponding path program 1 times [2022-11-03 03:43:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:18,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303973678] [2022-11-03 03:43:18,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:18,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:18,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:18,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303973678] [2022-11-03 03:43:18,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303973678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:18,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:18,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:43:18,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556497596] [2022-11-03 03:43:18,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:18,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:43:18,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:18,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:43:18,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:43:18,411 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 4 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-11-03 03:43:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:18,757 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-11-03 03:43:18,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:43:18,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-11-03 03:43:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:18,759 INFO L225 Difference]: With dead ends: 117 [2022-11-03 03:43:18,759 INFO L226 Difference]: Without dead ends: 117 [2022-11-03 03:43:18,760 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-11-03 03:43:18,761 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 148 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:18,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 44 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:43:18,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-03 03:43:18,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2022-11-03 03:43:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.8125) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2022-11-03 03:43:18,771 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 7 [2022-11-03 03:43:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:18,772 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2022-11-03 03:43:18,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-11-03 03:43:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2022-11-03 03:43:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:43:18,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:18,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:18,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:43:18,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:18,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:18,775 INFO L85 PathProgramCache]: Analyzing trace with hash -191356526, now seen corresponding path program 1 times [2022-11-03 03:43:18,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:18,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671271420] [2022-11-03 03:43:18,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:18,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:19,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:19,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671271420] [2022-11-03 03:43:19,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671271420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:19,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:19,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:43:19,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540949938] [2022-11-03 03:43:19,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:19,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:43:19,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:43:19,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:43:19,153 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-11-03 03:43:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:19,591 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-11-03 03:43:19,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:43:19,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-11-03 03:43:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:19,594 INFO L225 Difference]: With dead ends: 140 [2022-11-03 03:43:19,594 INFO L226 Difference]: Without dead ends: 140 [2022-11-03 03:43:19,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:43:19,596 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 138 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:19,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 81 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:43:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-03 03:43:19,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 117. [2022-11-03 03:43:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 116 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2022-11-03 03:43:19,622 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 7 [2022-11-03 03:43:19,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:19,622 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2022-11-03 03:43:19,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-11-03 03:43:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2022-11-03 03:43:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:43:19,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:19,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:19,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:43:19,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash 789967275, now seen corresponding path program 1 times [2022-11-03 03:43:19,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:19,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912932084] [2022-11-03 03:43:19,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:19,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:19,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:19,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912932084] [2022-11-03 03:43:19,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912932084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:19,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:19,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:43:19,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751456088] [2022-11-03 03:43:19,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:19,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:43:19,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:19,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:43:19,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:43:19,771 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:19,974 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-11-03 03:43:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:43:19,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 03:43:19,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:19,982 INFO L225 Difference]: With dead ends: 129 [2022-11-03 03:43:19,982 INFO L226 Difference]: Without dead ends: 129 [2022-11-03 03:43:19,982 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-11-03 03:43:19,988 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 116 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:19,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 105 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:43:19,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-03 03:43:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2022-11-03 03:43:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 114 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2022-11-03 03:43:19,996 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 9 [2022-11-03 03:43:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:19,997 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2022-11-03 03:43:19,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2022-11-03 03:43:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:43:19,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:19,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:20,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:43:20,005 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:20,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:20,007 INFO L85 PathProgramCache]: Analyzing trace with hash 790171077, now seen corresponding path program 1 times [2022-11-03 03:43:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:20,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222674700] [2022-11-03 03:43:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:20,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:20,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:20,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:20,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222674700] [2022-11-03 03:43:20,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222674700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:20,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:20,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:43:20,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421120784] [2022-11-03 03:43:20,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:20,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:43:20,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:20,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:43:20,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:43:20,450 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:20,699 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-11-03 03:43:20,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:43:20,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 03:43:20,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:20,700 INFO L225 Difference]: With dead ends: 114 [2022-11-03 03:43:20,700 INFO L226 Difference]: Without dead ends: 114 [2022-11-03 03:43:20,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:43:20,702 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 5 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:20,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 195 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:43:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-03 03:43:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-03 03:43:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 113 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2022-11-03 03:43:20,710 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 9 [2022-11-03 03:43:20,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:20,711 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2022-11-03 03:43:20,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2022-11-03 03:43:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:43:20,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:20,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:20,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:43:20,712 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:20,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash 790171076, now seen corresponding path program 1 times [2022-11-03 03:43:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:20,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035866301] [2022-11-03 03:43:20,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:20,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:20,880 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:20,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035866301] [2022-11-03 03:43:20,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035866301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:20,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:20,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:43:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751742992] [2022-11-03 03:43:20,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:20,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:43:20,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:20,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:43:20,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:43:20,884 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:21,117 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2022-11-03 03:43:21,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:43:21,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 03:43:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:21,119 INFO L225 Difference]: With dead ends: 113 [2022-11-03 03:43:21,119 INFO L226 Difference]: Without dead ends: 113 [2022-11-03 03:43:21,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:43:21,128 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:21,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 208 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:43:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-03 03:43:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-11-03 03:43:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.64) internal successors, (123), 112 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2022-11-03 03:43:21,149 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 9 [2022-11-03 03:43:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:21,150 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2022-11-03 03:43:21,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2022-11-03 03:43:21,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:43:21,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:21,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:21,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:43:21,155 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:21,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash -854603864, now seen corresponding path program 1 times [2022-11-03 03:43:21,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:21,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628108857] [2022-11-03 03:43:21,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:21,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:21,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:21,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628108857] [2022-11-03 03:43:21,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628108857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:21,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:21,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 03:43:21,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455878004] [2022-11-03 03:43:21,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:21,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:43:21,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:21,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:43:21,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:43:21,483 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:21,871 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-11-03 03:43:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:43:21,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:43:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:21,872 INFO L225 Difference]: With dead ends: 113 [2022-11-03 03:43:21,873 INFO L226 Difference]: Without dead ends: 113 [2022-11-03 03:43:21,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:43:21,873 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 121 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:21,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 137 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:43:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-03 03:43:21,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2022-11-03 03:43:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 111 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2022-11-03 03:43:21,887 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 11 [2022-11-03 03:43:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:21,887 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2022-11-03 03:43:21,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2022-11-03 03:43:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:43:21,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:21,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:21,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:43:21,890 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:21,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:21,890 INFO L85 PathProgramCache]: Analyzing trace with hash -854603863, now seen corresponding path program 1 times [2022-11-03 03:43:21,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:21,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30692939] [2022-11-03 03:43:21,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:21,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:22,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:22,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30692939] [2022-11-03 03:43:22,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30692939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:22,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:22,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:43:22,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087499202] [2022-11-03 03:43:22,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:22,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:43:22,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:22,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:43:22,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:43:22,315 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:22,802 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-11-03 03:43:22,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 03:43:22,802 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:43:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:22,803 INFO L225 Difference]: With dead ends: 114 [2022-11-03 03:43:22,803 INFO L226 Difference]: Without dead ends: 114 [2022-11-03 03:43:22,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-11-03 03:43:22,804 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 120 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:22,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 142 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:43:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-03 03:43:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-11-03 03:43:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2022-11-03 03:43:22,809 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 11 [2022-11-03 03:43:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:22,810 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2022-11-03 03:43:22,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2022-11-03 03:43:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:43:22,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:22,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:22,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 03:43:22,811 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:22,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1793276823, now seen corresponding path program 1 times [2022-11-03 03:43:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:22,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259268824] [2022-11-03 03:43:22,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:22,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:22,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:22,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259268824] [2022-11-03 03:43:22,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259268824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:22,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:22,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:43:22,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631561384] [2022-11-03 03:43:22,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:22,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:43:22,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:22,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:43:22,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:43:22,989 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-11-03 03:43:23,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:23,215 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2022-11-03 03:43:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:43:23,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-11-03 03:43:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:23,216 INFO L225 Difference]: With dead ends: 161 [2022-11-03 03:43:23,216 INFO L226 Difference]: Without dead ends: 161 [2022-11-03 03:43:23,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:43:23,217 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 189 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:23,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 168 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:43:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-03 03:43:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2022-11-03 03:43:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 112 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2022-11-03 03:43:23,221 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 12 [2022-11-03 03:43:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:23,222 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2022-11-03 03:43:23,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-11-03 03:43:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2022-11-03 03:43:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:43:23,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:23,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:23,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 03:43:23,223 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:23,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:23,223 INFO L85 PathProgramCache]: Analyzing trace with hash -50027826, now seen corresponding path program 1 times [2022-11-03 03:43:23,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:23,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372678358] [2022-11-03 03:43:23,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:23,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:23,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:23,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372678358] [2022-11-03 03:43:23,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372678358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:23,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:23,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:43:23,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427583373] [2022-11-03 03:43:23,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:23,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:43:23,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:23,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:43:23,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:43:23,362 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:23,506 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-11-03 03:43:23,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:43:23,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:43:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:23,508 INFO L225 Difference]: With dead ends: 112 [2022-11-03 03:43:23,508 INFO L226 Difference]: Without dead ends: 112 [2022-11-03 03:43:23,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:43:23,509 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:23,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 191 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:43:23,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-03 03:43:23,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-03 03:43:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.5) internal successors, (123), 111 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2022-11-03 03:43:23,512 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 16 [2022-11-03 03:43:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:23,513 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2022-11-03 03:43:23,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-11-03 03:43:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:43:23,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:23,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:23,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 03:43:23,514 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:23,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:23,515 INFO L85 PathProgramCache]: Analyzing trace with hash -50027825, now seen corresponding path program 1 times [2022-11-03 03:43:23,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:23,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95399437] [2022-11-03 03:43:23,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:23,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:23,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:23,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95399437] [2022-11-03 03:43:23,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95399437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:23,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:23,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:43:23,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716240720] [2022-11-03 03:43:23,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:23,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:43:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:23,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:43:23,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:43:23,774 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:23,947 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-11-03 03:43:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:43:23,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:43:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:23,948 INFO L225 Difference]: With dead ends: 111 [2022-11-03 03:43:23,948 INFO L226 Difference]: Without dead ends: 111 [2022-11-03 03:43:23,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:43:23,949 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:23,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:43:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-03 03:43:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-03 03:43:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 110 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-11-03 03:43:23,952 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 16 [2022-11-03 03:43:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:23,953 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-11-03 03:43:23,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-11-03 03:43:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:43:23,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:23,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:23,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 03:43:23,954 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2126705211, now seen corresponding path program 1 times [2022-11-03 03:43:23,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:23,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806136318] [2022-11-03 03:43:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:23,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:24,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:24,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806136318] [2022-11-03 03:43:24,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806136318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:24,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:24,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:43:24,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750425762] [2022-11-03 03:43:24,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:24,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:43:24,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:24,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:43:24,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:43:24,075 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-03 03:43:24,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:24,235 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-11-03 03:43:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:43:24,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-03 03:43:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:24,236 INFO L225 Difference]: With dead ends: 112 [2022-11-03 03:43:24,237 INFO L226 Difference]: Without dead ends: 112 [2022-11-03 03:43:24,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:43:24,238 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:24,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 176 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:43:24,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-03 03:43:24,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2022-11-03 03:43:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 109 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-11-03 03:43:24,241 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 17 [2022-11-03 03:43:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:24,242 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-11-03 03:43:24,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-03 03:43:24,242 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-11-03 03:43:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:43:24,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:24,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:24,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 03:43:24,244 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:24,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:24,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1503141088, now seen corresponding path program 1 times [2022-11-03 03:43:24,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:24,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421227261] [2022-11-03 03:43:24,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:24,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:43:24,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:43:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:43:24,287 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:43:24,288 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:43:24,289 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (64 of 65 remaining) [2022-11-03 03:43:24,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 65 remaining) [2022-11-03 03:43:24,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 65 remaining) [2022-11-03 03:43:24,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 65 remaining) [2022-11-03 03:43:24,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 65 remaining) [2022-11-03 03:43:24,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 65 remaining) [2022-11-03 03:43:24,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 65 remaining) [2022-11-03 03:43:24,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 65 remaining) [2022-11-03 03:43:24,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 65 remaining) [2022-11-03 03:43:24,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 65 remaining) [2022-11-03 03:43:24,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 65 remaining) [2022-11-03 03:43:24,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 65 remaining) [2022-11-03 03:43:24,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 65 remaining) [2022-11-03 03:43:24,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 65 remaining) [2022-11-03 03:43:24,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 65 remaining) [2022-11-03 03:43:24,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 65 remaining) [2022-11-03 03:43:24,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 65 remaining) [2022-11-03 03:43:24,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 65 remaining) [2022-11-03 03:43:24,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 65 remaining) [2022-11-03 03:43:24,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 65 remaining) [2022-11-03 03:43:24,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 65 remaining) [2022-11-03 03:43:24,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 65 remaining) [2022-11-03 03:43:24,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 65 remaining) [2022-11-03 03:43:24,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 65 remaining) [2022-11-03 03:43:24,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 65 remaining) [2022-11-03 03:43:24,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 65 remaining) [2022-11-03 03:43:24,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 65 remaining) [2022-11-03 03:43:24,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 65 remaining) [2022-11-03 03:43:24,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 65 remaining) [2022-11-03 03:43:24,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 65 remaining) [2022-11-03 03:43:24,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 65 remaining) [2022-11-03 03:43:24,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 65 remaining) [2022-11-03 03:43:24,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 65 remaining) [2022-11-03 03:43:24,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (31 of 65 remaining) [2022-11-03 03:43:24,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 65 remaining) [2022-11-03 03:43:24,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 65 remaining) [2022-11-03 03:43:24,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK (28 of 65 remaining) [2022-11-03 03:43:24,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 65 remaining) [2022-11-03 03:43:24,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 65 remaining) [2022-11-03 03:43:24,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 65 remaining) [2022-11-03 03:43:24,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 65 remaining) [2022-11-03 03:43:24,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 65 remaining) [2022-11-03 03:43:24,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 65 remaining) [2022-11-03 03:43:24,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 65 remaining) [2022-11-03 03:43:24,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 65 remaining) [2022-11-03 03:43:24,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 65 remaining) [2022-11-03 03:43:24,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 65 remaining) [2022-11-03 03:43:24,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 65 remaining) [2022-11-03 03:43:24,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 65 remaining) [2022-11-03 03:43:24,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 65 remaining) [2022-11-03 03:43:24,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 65 remaining) [2022-11-03 03:43:24,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (13 of 65 remaining) [2022-11-03 03:43:24,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (12 of 65 remaining) [2022-11-03 03:43:24,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (11 of 65 remaining) [2022-11-03 03:43:24,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 65 remaining) [2022-11-03 03:43:24,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 65 remaining) [2022-11-03 03:43:24,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (8 of 65 remaining) [2022-11-03 03:43:24,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (7 of 65 remaining) [2022-11-03 03:43:24,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (6 of 65 remaining) [2022-11-03 03:43:24,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 65 remaining) [2022-11-03 03:43:24,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 65 remaining) [2022-11-03 03:43:24,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (3 of 65 remaining) [2022-11-03 03:43:24,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (2 of 65 remaining) [2022-11-03 03:43:24,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (1 of 65 remaining) [2022-11-03 03:43:24,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (0 of 65 remaining) [2022-11-03 03:43:24,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 03:43:24,312 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:24,316 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:43:24,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:43:24 BoogieIcfgContainer [2022-11-03 03:43:24,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:43:24,343 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:43:24,343 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:43:24,343 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:43:24,343 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:43:16" (3/4) ... [2022-11-03 03:43:24,346 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 03:43:24,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:43:24,347 INFO L158 Benchmark]: Toolchain (without parser) took 9273.11ms. Allocated memory was 96.5MB in the beginning and 182.5MB in the end (delta: 86.0MB). Free memory was 61.2MB in the beginning and 65.4MB in the end (delta: -4.2MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2022-11-03 03:43:24,348 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 96.5MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:43:24,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.33ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 66.4MB in the end (delta: -5.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 03:43:24,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.44ms. Allocated memory is still 96.5MB. Free memory was 66.4MB in the beginning and 64.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:43:24,348 INFO L158 Benchmark]: Boogie Preprocessor took 38.81ms. Allocated memory is still 96.5MB. Free memory was 64.3MB in the beginning and 62.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:43:24,349 INFO L158 Benchmark]: RCFGBuilder took 1002.43ms. Allocated memory was 96.5MB in the beginning and 138.4MB in the end (delta: 41.9MB). Free memory was 62.5MB in the beginning and 108.2MB in the end (delta: -45.7MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2022-11-03 03:43:24,349 INFO L158 Benchmark]: TraceAbstraction took 7497.36ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 108.2MB in the beginning and 65.4MB in the end (delta: 42.7MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. [2022-11-03 03:43:24,349 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 182.5MB. Free memory is still 65.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:43:24,351 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.31ms. Allocated memory is still 96.5MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 662.33ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 66.4MB in the end (delta: -5.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.44ms. Allocated memory is still 96.5MB. Free memory was 66.4MB in the beginning and 64.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.81ms. Allocated memory is still 96.5MB. Free memory was 64.3MB in the beginning and 62.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1002.43ms. Allocated memory was 96.5MB in the beginning and 138.4MB in the end (delta: 41.9MB). Free memory was 62.5MB in the beginning and 108.2MB in the end (delta: -45.7MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7497.36ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 108.2MB in the beginning and 65.4MB in the end (delta: 42.7MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 182.5MB. Free memory is still 65.4MB. There was no memory consumed. 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 - UnprovableResult [Line: 1051]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1051. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) VAL [list={-1:0}] [L1007] list->prev = ((void*)0) VAL [list={-1:0}] [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={-1:0}, list={-1:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1041] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}] [L1045] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}] [L1051] COND TRUE !(end->next) [L1051] reach_error() VAL [end={-1:0}, list={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1057 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1057 mSDsluCounter, 1752 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1124 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2435 IncrementalHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 695 mSDtfsCounter, 2435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 121 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2022-11-03 03:43:24,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- 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-5e519f3 [2022-11-03 03:43:26,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:43:26,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:43:26,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:43:26,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:43:26,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:43:26,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:43:26,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:43:26,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:43:26,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:43:26,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:43:26,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:43:26,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:43:26,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:43:26,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:43:26,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:43:26,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:43:26,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:43:26,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:43:26,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:43:26,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:43:26,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:43:26,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:43:26,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:43:26,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:43:26,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:43:26,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:43:26,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:43:26,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:43:26,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:43:26,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:43:26,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:43:26,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:43:26,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:43:26,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:43:26,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:43:26,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:43:26,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:43:26,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:43:26,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:43:26,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:43:26,888 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-03 03:43:26,932 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:43:26,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:43:26,934 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:43:26,934 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:43:26,935 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:43:26,935 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:43:26,935 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:43:26,936 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:43:26,936 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:43:26,936 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:43:26,937 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:43:26,938 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:43:26,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 03:43:26,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 03:43:26,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:43:26,940 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:43:26,940 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:43:26,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:43:26,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:43:26,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:43:26,941 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 03:43:26,941 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 03:43:26,941 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 03:43:26,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:43:26,942 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 03:43:26,942 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 03:43:26,942 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 03:43:26,942 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:43:26,942 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:43:26,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:43:26,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 03:43:26,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:43:26,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:43:26,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:43:26,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:43:26,945 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 03:43:26,945 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 03:43:26,945 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:43:26,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 03:43:26,946 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2022-11-03 03:43:27,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:43:27,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:43:27,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:43:27,366 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:43:27,367 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:43:27,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2022-11-03 03:43:27,452 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/data/72f8bb2d4/106074b9b76b46ada6b40ef1147f3307/FLAG1b6b8565c [2022-11-03 03:43:28,099 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:43:28,101 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2022-11-03 03:43:28,120 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/data/72f8bb2d4/106074b9b76b46ada6b40ef1147f3307/FLAG1b6b8565c [2022-11-03 03:43:28,351 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/data/72f8bb2d4/106074b9b76b46ada6b40ef1147f3307 [2022-11-03 03:43:28,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:43:28,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:43:28,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:43:28,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:43:28,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:43:28,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:43:28" (1/1) ... [2022-11-03 03:43:28,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66954d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:28, skipping insertion in model container [2022-11-03 03:43:28,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:43:28" (1/1) ... [2022-11-03 03:43:28,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:43:28,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:43:28,882 WARN L230 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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2022-11-03 03:43:28,889 WARN L230 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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2022-11-03 03:43:28,893 WARN L230 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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2022-11-03 03:43:28,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:43:28,929 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:43:28,986 WARN L230 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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2022-11-03 03:43:28,989 WARN L230 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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2022-11-03 03:43:28,994 WARN L230 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_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2022-11-03 03:43:28,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:43:29,031 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:43:29,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:29 WrapperNode [2022-11-03 03:43:29,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:43:29,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:43:29,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:43:29,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:43:29,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:29" (1/1) ... [2022-11-03 03:43:29,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:29" (1/1) ... [2022-11-03 03:43:29,082 INFO L138 Inliner]: procedures = 122, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2022-11-03 03:43:29,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:43:29,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:43:29,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:43:29,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:43:29,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:29" (1/1) ... [2022-11-03 03:43:29,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:29" (1/1) ... [2022-11-03 03:43:29,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:29" (1/1) ... [2022-11-03 03:43:29,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:29" (1/1) ... [2022-11-03 03:43:29,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:29" (1/1) ... [2022-11-03 03:43:29,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:29" (1/1) ... [2022-11-03 03:43:29,115 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:29" (1/1) ... [2022-11-03 03:43:29,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:29" (1/1) ... [2022-11-03 03:43:29,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:43:29,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:43:29,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:43:29,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:43:29,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:29" (1/1) ... [2022-11-03 03:43:29,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:43:29,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:29,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:43:29,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:43:29,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 03:43:29,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:43:29,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:43:29,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 03:43:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 03:43:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:43:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 03:43:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 03:43:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:43:29,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:43:29,345 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:43:29,347 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:43:30,276 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:43:30,286 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:43:30,286 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-03 03:43:30,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:43:30 BoogieIcfgContainer [2022-11-03 03:43:30,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:43:30,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:43:30,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:43:30,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:43:30,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:43:28" (1/3) ... [2022-11-03 03:43:30,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201b00e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:43:30, skipping insertion in model container [2022-11-03 03:43:30,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:43:29" (2/3) ... [2022-11-03 03:43:30,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201b00e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:43:30, skipping insertion in model container [2022-11-03 03:43:30,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:43:30" (3/3) ... [2022-11-03 03:43:30,303 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2022-11-03 03:43:30,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:43:30,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2022-11-03 03:43:30,392 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:43:30,406 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@211e4d97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:43:30,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-11-03 03:43:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 70 states have (on average 2.1857142857142855) internal successors, (153), 135 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:43:30,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:30,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:43:30,422 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:30,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:30,430 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-03 03:43:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:43:30,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476701963] [2022-11-03 03:43:30,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:30,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:43:30,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:43:30,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:43:30,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 03:43:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:30,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:43:30,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:30,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 03:43:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:30,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:43:30,725 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:43:30,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476701963] [2022-11-03 03:43:30,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476701963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:30,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:30,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:43:30,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131605688] [2022-11-03 03:43:30,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:30,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:43:30,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:43:30,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:43:30,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:43:30,796 INFO L87 Difference]: Start difference. First operand has 136 states, 70 states have (on average 2.1857142857142855) internal successors, (153), 135 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:31,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:31,295 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2022-11-03 03:43:31,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:43:31,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:43:31,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:31,309 INFO L225 Difference]: With dead ends: 137 [2022-11-03 03:43:31,310 INFO L226 Difference]: Without dead ends: 133 [2022-11-03 03:43:31,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:43:31,316 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:31,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 77 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:43:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-03 03:43:31,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2022-11-03 03:43:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 128 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2022-11-03 03:43:31,383 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 3 [2022-11-03 03:43:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:31,383 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2022-11-03 03:43:31,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2022-11-03 03:43:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:43:31,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:31,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:43:31,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:31,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:43:31,586 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:31,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-03 03:43:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:43:31,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902941554] [2022-11-03 03:43:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:31,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:43:31,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:43:31,590 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:43:31,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 03:43:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:31,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:43:31,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:31,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:43:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:31,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:43:31,712 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:43:31,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902941554] [2022-11-03 03:43:31,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902941554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:31,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:31,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:43:31,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513272309] [2022-11-03 03:43:31,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:31,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:43:31,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:43:31,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:43:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:43:31,718 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:32,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:32,253 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2022-11-03 03:43:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:43:32,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:43:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:32,256 INFO L225 Difference]: With dead ends: 146 [2022-11-03 03:43:32,256 INFO L226 Difference]: Without dead ends: 146 [2022-11-03 03:43:32,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:43:32,258 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 111 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:32,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 82 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:43:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-03 03:43:32,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2022-11-03 03:43:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.794871794871795) internal successors, (140), 132 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2022-11-03 03:43:32,272 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 3 [2022-11-03 03:43:32,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:32,273 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2022-11-03 03:43:32,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2022-11-03 03:43:32,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:43:32,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:32,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:32,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:32,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:43:32,489 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash 59261803, now seen corresponding path program 1 times [2022-11-03 03:43:32,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:43:32,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507489252] [2022-11-03 03:43:32,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:32,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:43:32,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:43:32,494 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:43:32,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 03:43:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:32,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:43:32,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:32,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 03:43:32,731 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:43:32,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 03:43:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:32,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:43:32,760 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:43:32,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507489252] [2022-11-03 03:43:32,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507489252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:32,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:32,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:43:32,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895418569] [2022-11-03 03:43:32,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:32,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:43:32,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:43:32,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:43:32,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:43:32,767 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:33,364 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-11-03 03:43:33,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:43:33,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 03:43:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:33,368 INFO L225 Difference]: With dead ends: 138 [2022-11-03 03:43:33,368 INFO L226 Difference]: Without dead ends: 138 [2022-11-03 03:43:33,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:43:33,370 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 182 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:33,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 63 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 03:43:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-03 03:43:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2022-11-03 03:43:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.6419753086419753) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-11-03 03:43:33,398 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 8 [2022-11-03 03:43:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:33,399 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-11-03 03:43:33,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-11-03 03:43:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:43:33,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:33,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:33,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:33,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:43:33,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:33,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:33,607 INFO L85 PathProgramCache]: Analyzing trace with hash 59261804, now seen corresponding path program 1 times [2022-11-03 03:43:33,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:43:33,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092933494] [2022-11-03 03:43:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:33,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:43:33,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:43:33,612 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:43:33,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 03:43:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:33,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:43:33,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:33,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:43:33,876 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:43:33,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 03:43:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:33,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:43:33,902 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:43:33,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092933494] [2022-11-03 03:43:33,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092933494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:33,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:33,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:43:33,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141062675] [2022-11-03 03:43:33,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:33,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:43:33,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:43:33,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:43:33,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:43:33,908 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:34,582 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2022-11-03 03:43:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:43:34,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 03:43:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:34,584 INFO L225 Difference]: With dead ends: 166 [2022-11-03 03:43:34,584 INFO L226 Difference]: Without dead ends: 166 [2022-11-03 03:43:34,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:43:34,586 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 169 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:34,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 93 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 03:43:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-03 03:43:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 135. [2022-11-03 03:43:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.5851063829787233) internal successors, (149), 134 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2022-11-03 03:43:34,596 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 8 [2022-11-03 03:43:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:34,596 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2022-11-03 03:43:34,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2022-11-03 03:43:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:43:34,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:34,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:34,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:34,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:43:34,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:34,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:34,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1116012804, now seen corresponding path program 1 times [2022-11-03 03:43:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:43:34,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602965485] [2022-11-03 03:43:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:34,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:43:34,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:43:34,810 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:43:34,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 03:43:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:34,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:43:34,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:34,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:43:34,944 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:43:34,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602965485] [2022-11-03 03:43:34,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602965485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:34,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:34,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:43:34,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057683817] [2022-11-03 03:43:34,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:34,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:43:34,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:43:34,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:43:34,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:43:34,948 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:35,363 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2022-11-03 03:43:35,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:43:35,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 03:43:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:35,365 INFO L225 Difference]: With dead ends: 151 [2022-11-03 03:43:35,365 INFO L226 Difference]: Without dead ends: 151 [2022-11-03 03:43:35,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:43:35,366 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 141 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:35,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 142 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:43:35,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-03 03:43:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2022-11-03 03:43:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.5591397849462365) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-11-03 03:43:35,374 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 10 [2022-11-03 03:43:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:35,375 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-11-03 03:43:35,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-11-03 03:43:35,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:43:35,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:35,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:35,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:35,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:43:35,592 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:35,593 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2022-11-03 03:43:35,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:43:35,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489603268] [2022-11-03 03:43:35,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:35,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:43:35,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:43:35,594 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:43:35,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 03:43:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:35,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:43:35,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:35,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 03:43:35,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 03:43:35,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:43:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:35,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:43:35,825 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:43:35,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489603268] [2022-11-03 03:43:35,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489603268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:35,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:35,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:43:35,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100749451] [2022-11-03 03:43:35,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:35,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:43:35,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:43:35,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:43:35,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:43:35,828 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:36,373 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-11-03 03:43:36,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:43:36,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:43:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:36,375 INFO L225 Difference]: With dead ends: 132 [2022-11-03 03:43:36,375 INFO L226 Difference]: Without dead ends: 132 [2022-11-03 03:43:36,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:43:36,376 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 9 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:36,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 270 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:43:36,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-03 03:43:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-03 03:43:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.5376344086021505) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-11-03 03:43:36,384 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 11 [2022-11-03 03:43:36,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:36,385 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-11-03 03:43:36,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:36,385 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-11-03 03:43:36,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:43:36,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:36,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:36,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:36,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:43:36,603 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:36,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2022-11-03 03:43:36,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:43:36,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948795935] [2022-11-03 03:43:36,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:36,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:43:36,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:43:36,607 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:43:36,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 03:43:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:36,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 03:43:36,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:36,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:43:36,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 03:43:36,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 03:43:36,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-11-03 03:43:36,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:43:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:36,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:43:36,878 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:43:36,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948795935] [2022-11-03 03:43:36,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948795935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:36,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:36,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:43:36,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869583607] [2022-11-03 03:43:36,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:36,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:43:36,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:43:36,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:43:36,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:43:36,882 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:37,527 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-11-03 03:43:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:43:37,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:43:37,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:37,529 INFO L225 Difference]: With dead ends: 131 [2022-11-03 03:43:37,529 INFO L226 Difference]: Without dead ends: 131 [2022-11-03 03:43:37,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:43:37,530 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:37,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 259 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 03:43:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-03 03:43:37,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-11-03 03:43:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2022-11-03 03:43:37,537 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 11 [2022-11-03 03:43:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:37,550 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2022-11-03 03:43:37,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2022-11-03 03:43:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:43:37,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:37,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:37,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:37,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:43:37,753 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:37,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash -200394276, now seen corresponding path program 1 times [2022-11-03 03:43:37,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:43:37,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071169983] [2022-11-03 03:43:37,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:37,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:43:37,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:43:37,756 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:43:37,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 03:43:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:37,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:43:37,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:37,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:43:37,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 03:43:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:37,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:43:37,982 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:43:37,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071169983] [2022-11-03 03:43:37,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071169983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:37,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:37,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:43:37,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221739284] [2022-11-03 03:43:37,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:37,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:43:37,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:43:37,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:43:37,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:43:37,986 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:38,593 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2022-11-03 03:43:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:43:38,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 03:43:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:38,594 INFO L225 Difference]: With dead ends: 191 [2022-11-03 03:43:38,594 INFO L226 Difference]: Without dead ends: 191 [2022-11-03 03:43:38,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:43:38,596 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 81 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:38,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 267 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:43:38,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-03 03:43:38,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 136. [2022-11-03 03:43:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 98 states have (on average 1.489795918367347) internal successors, (146), 135 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2022-11-03 03:43:38,602 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 13 [2022-11-03 03:43:38,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:38,602 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2022-11-03 03:43:38,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2022-11-03 03:43:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:43:38,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:38,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:38,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:38,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:43:38,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:38,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2022-11-03 03:43:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:43:38,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477225786] [2022-11-03 03:43:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:38,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:43:38,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:43:38,818 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:43:38,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 03:43:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:38,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 03:43:38,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:38,980 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 03:43:38,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2022-11-03 03:43:39,133 INFO L356 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-03 03:43:39,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-11-03 03:43:39,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 03:43:39,421 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:43:39,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 03:43:39,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 27 [2022-11-03 03:43:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:39,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:43:39,631 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:43:39,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477225786] [2022-11-03 03:43:39,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477225786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:39,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:39,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:43:39,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525458941] [2022-11-03 03:43:39,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:39,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 03:43:39,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:43:39,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 03:43:39,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-03 03:43:39,633 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:41,172 INFO L93 Difference]: Finished difference Result 213 states and 230 transitions. [2022-11-03 03:43:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:43:41,173 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-11-03 03:43:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:41,174 INFO L225 Difference]: With dead ends: 213 [2022-11-03 03:43:41,174 INFO L226 Difference]: Without dead ends: 213 [2022-11-03 03:43:41,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-11-03 03:43:41,175 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 168 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:41,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 365 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 377 Invalid, 0 Unknown, 173 Unchecked, 1.0s Time] [2022-11-03 03:43:41,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-03 03:43:41,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 138. [2022-11-03 03:43:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 100 states have (on average 1.49) internal successors, (149), 137 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2022-11-03 03:43:41,182 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 15 [2022-11-03 03:43:41,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:41,182 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2022-11-03 03:43:41,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2022-11-03 03:43:41,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:43:41,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:41,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:41,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-11-03 03:43:41,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:43:41,394 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:41,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2022-11-03 03:43:41,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:43:41,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022140996] [2022-11-03 03:43:41,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:41,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:43:41,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:43:41,396 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:43:41,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 03:43:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:41,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 03:43:41,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:41,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 03:43:41,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:43:41,589 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:43:41,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 03:43:41,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 03:43:41,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 03:43:41,732 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:43:41,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-03 03:43:41,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 03:43:41,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-03 03:43:41,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:43:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:41,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:43:41,833 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:43:41,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022140996] [2022-11-03 03:43:41,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022140996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:41,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:41,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:43:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268326415] [2022-11-03 03:43:41,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:41,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:43:41,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:43:41,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:43:41,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:43:41,835 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:43,167 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2022-11-03 03:43:43,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 03:43:43,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-11-03 03:43:43,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:43,169 INFO L225 Difference]: With dead ends: 142 [2022-11-03 03:43:43,169 INFO L226 Difference]: Without dead ends: 142 [2022-11-03 03:43:43,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-11-03 03:43:43,170 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 157 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:43,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 193 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 03:43:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-03 03:43:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2022-11-03 03:43:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 107 states have (on average 1.4018691588785046) internal successors, (150), 138 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2022-11-03 03:43:43,175 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 15 [2022-11-03 03:43:43,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:43,175 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2022-11-03 03:43:43,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2022-11-03 03:43:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:43:43,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:43,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:43,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-11-03 03:43:43,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:43:43,388 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:43,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:43,389 INFO L85 PathProgramCache]: Analyzing trace with hash -715208061, now seen corresponding path program 1 times [2022-11-03 03:43:43,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:43:43,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415903379] [2022-11-03 03:43:43,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:43,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:43:43,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:43:43,390 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:43:43,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-03 03:43:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:43,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:43:43,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:43,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:43:43,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 03:43:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:43,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:43:43,561 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:43:43,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415903379] [2022-11-03 03:43:43,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415903379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:43:43,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:43:43,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:43:43,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262143429] [2022-11-03 03:43:43,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:43:43,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:43:43,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:43:43,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:43:43,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:43:43,563 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:44,130 INFO L93 Difference]: Finished difference Result 192 states and 207 transitions. [2022-11-03 03:43:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:43:44,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 03:43:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:44,132 INFO L225 Difference]: With dead ends: 192 [2022-11-03 03:43:44,132 INFO L226 Difference]: Without dead ends: 192 [2022-11-03 03:43:44,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:43:44,133 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:44,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 251 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:43:44,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-03 03:43:44,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 143. [2022-11-03 03:43:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 142 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2022-11-03 03:43:44,138 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 19 [2022-11-03 03:43:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:44,139 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2022-11-03 03:43:44,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:44,139 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2022-11-03 03:43:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:43:44,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:44,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:44,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:44,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:43:44,340 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-03 03:43:44,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:44,341 INFO L85 PathProgramCache]: Analyzing trace with hash -714897179, now seen corresponding path program 1 times [2022-11-03 03:43:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:43:44,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131185949] [2022-11-03 03:43:44,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:44,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:43:44,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:43:44,343 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:43:44,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-03 03:43:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:43:44,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:43:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:43:44,552 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-03 03:43:44,553 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:43:44,554 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (64 of 65 remaining) [2022-11-03 03:43:44,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 65 remaining) [2022-11-03 03:43:44,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 65 remaining) [2022-11-03 03:43:44,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 65 remaining) [2022-11-03 03:43:44,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 65 remaining) [2022-11-03 03:43:44,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 65 remaining) [2022-11-03 03:43:44,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 65 remaining) [2022-11-03 03:43:44,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 65 remaining) [2022-11-03 03:43:44,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 65 remaining) [2022-11-03 03:43:44,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 65 remaining) [2022-11-03 03:43:44,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 65 remaining) [2022-11-03 03:43:44,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 65 remaining) [2022-11-03 03:43:44,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 65 remaining) [2022-11-03 03:43:44,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 65 remaining) [2022-11-03 03:43:44,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 65 remaining) [2022-11-03 03:43:44,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 65 remaining) [2022-11-03 03:43:44,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 65 remaining) [2022-11-03 03:43:44,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 65 remaining) [2022-11-03 03:43:44,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 65 remaining) [2022-11-03 03:43:44,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 65 remaining) [2022-11-03 03:43:44,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 65 remaining) [2022-11-03 03:43:44,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 65 remaining) [2022-11-03 03:43:44,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 65 remaining) [2022-11-03 03:43:44,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 65 remaining) [2022-11-03 03:43:44,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 65 remaining) [2022-11-03 03:43:44,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 65 remaining) [2022-11-03 03:43:44,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 65 remaining) [2022-11-03 03:43:44,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 65 remaining) [2022-11-03 03:43:44,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 65 remaining) [2022-11-03 03:43:44,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 65 remaining) [2022-11-03 03:43:44,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 65 remaining) [2022-11-03 03:43:44,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 65 remaining) [2022-11-03 03:43:44,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 65 remaining) [2022-11-03 03:43:44,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (31 of 65 remaining) [2022-11-03 03:43:44,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 65 remaining) [2022-11-03 03:43:44,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 65 remaining) [2022-11-03 03:43:44,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK (28 of 65 remaining) [2022-11-03 03:43:44,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 65 remaining) [2022-11-03 03:43:44,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 65 remaining) [2022-11-03 03:43:44,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 65 remaining) [2022-11-03 03:43:44,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 65 remaining) [2022-11-03 03:43:44,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 65 remaining) [2022-11-03 03:43:44,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 65 remaining) [2022-11-03 03:43:44,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 65 remaining) [2022-11-03 03:43:44,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 65 remaining) [2022-11-03 03:43:44,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 65 remaining) [2022-11-03 03:43:44,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 65 remaining) [2022-11-03 03:43:44,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 65 remaining) [2022-11-03 03:43:44,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 65 remaining) [2022-11-03 03:43:44,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 65 remaining) [2022-11-03 03:43:44,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 65 remaining) [2022-11-03 03:43:44,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (13 of 65 remaining) [2022-11-03 03:43:44,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (12 of 65 remaining) [2022-11-03 03:43:44,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (11 of 65 remaining) [2022-11-03 03:43:44,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 65 remaining) [2022-11-03 03:43:44,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 65 remaining) [2022-11-03 03:43:44,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (8 of 65 remaining) [2022-11-03 03:43:44,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (7 of 65 remaining) [2022-11-03 03:43:44,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (6 of 65 remaining) [2022-11-03 03:43:44,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 65 remaining) [2022-11-03 03:43:44,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 65 remaining) [2022-11-03 03:43:44,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (3 of 65 remaining) [2022-11-03 03:43:44,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (2 of 65 remaining) [2022-11-03 03:43:44,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (1 of 65 remaining) [2022-11-03 03:43:44,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (0 of 65 remaining) [2022-11-03 03:43:44,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:44,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:43:44,784 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:44,789 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:43:44,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:43:44 BoogieIcfgContainer [2022-11-03 03:43:44,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:43:44,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:43:44,818 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:43:44,818 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:43:44,819 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:43:30" (3/4) ... [2022-11-03 03:43:44,822 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 03:43:44,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:43:44,823 INFO L158 Benchmark]: Toolchain (without parser) took 16464.74ms. Allocated memory was 79.7MB in the beginning and 142.6MB in the end (delta: 62.9MB). Free memory was 55.8MB in the beginning and 110.6MB in the end (delta: -54.7MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-11-03 03:43:44,824 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 52.4MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:43:44,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.50ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 55.6MB in the end (delta: 78.1kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 03:43:44,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.74ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 53.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:43:44,825 INFO L158 Benchmark]: Boogie Preprocessor took 36.13ms. Allocated memory is still 79.7MB. Free memory was 53.2MB in the beginning and 51.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:43:44,825 INFO L158 Benchmark]: RCFGBuilder took 1168.99ms. Allocated memory is still 79.7MB. Free memory was 51.1MB in the beginning and 45.5MB in the end (delta: 5.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2022-11-03 03:43:44,826 INFO L158 Benchmark]: TraceAbstraction took 14524.98ms. Allocated memory was 79.7MB in the beginning and 142.6MB in the end (delta: 62.9MB). Free memory was 44.9MB in the beginning and 110.6MB in the end (delta: -65.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:43:44,826 INFO L158 Benchmark]: Witness Printer took 5.17ms. Allocated memory is still 142.6MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:43:44,828 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.26ms. Allocated memory is still 52.4MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.50ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 55.6MB in the end (delta: 78.1kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.74ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 53.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.13ms. Allocated memory is still 79.7MB. Free memory was 53.2MB in the beginning and 51.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1168.99ms. Allocated memory is still 79.7MB. Free memory was 51.1MB in the beginning and 45.5MB in the end (delta: 5.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14524.98ms. Allocated memory was 79.7MB in the beginning and 142.6MB in the end (delta: 62.9MB). Free memory was 44.9MB in the beginning and 110.6MB in the end (delta: -65.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.17ms. Allocated memory is still 142.6MB. Free memory is still 110.6MB. There was no memory consumed. 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 - UnprovableResult [Line: 1051]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1051. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) VAL [list={6:0}] [L1007] list->prev = ((void*)0) VAL [list={6:0}] [L1008] list->colour = BLACK VAL [list={6:0}] [L1010] SLL* end = list; VAL [end={6:0}, list={6:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={6:0}, list={6:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={6:0}, list={6:0}] [L1041] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end VAL [end={6:0}, list={6:0}] [L1045] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next VAL [end={6:0}, end->next={0:0}, list={6:0}] [L1051] COND TRUE !(end->next) [L1051] reach_error() VAL [end={6:0}, list={6:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 136 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1211 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1211 mSDsluCounter, 2062 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 173 IncrementalHoareTripleChecker+Unchecked, 1246 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2024 IncrementalHoareTripleChecker+Invalid, 2328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 816 mSDtfsCounter, 2024 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=11, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 263 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 105 ConstructedInterpolants, 2 QuantifiedInterpolants, 992 SizeOfPredicates, 41 NumberOfNonLiveVariables, 843 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2022-11-03 03:43:44,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d42d8fa-d06f-4a9a-a9b8-7aad4ec0802f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample