./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-circular-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b74df92940ca0e86c8c02c3eca1e89fb6c9c9c1248a25cd764acf39f7727180 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 15:41:27,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:41:27,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:41:27,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:41:27,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:41:27,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:41:27,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:41:27,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:41:27,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:41:27,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:41:27,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:41:27,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:41:27,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:41:27,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:41:27,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:41:27,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:41:27,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:41:27,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:41:27,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:41:27,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:41:27,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:41:27,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:41:27,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:41:27,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:41:27,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:41:27,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:41:27,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:41:27,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:41:27,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:41:27,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:41:27,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:41:27,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:41:27,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:41:27,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:41:27,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:41:27,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:41:27,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:41:27,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:41:27,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:41:27,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:41:27,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:41:27,745 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-12-14 15:41:27,765 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:41:27,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:41:27,766 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:41:27,766 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:41:27,767 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:41:27,767 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:41:27,767 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:41:27,767 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:41:27,768 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:41:27,768 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:41:27,768 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:41:27,768 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:41:27,768 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:41:27,769 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:41:27,769 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:41:27,769 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:41:27,769 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:41:27,769 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:41:27,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 15:41:27,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 15:41:27,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:41:27,770 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:41:27,770 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:41:27,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:41:27,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:41:27,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:41:27,771 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 15:41:27,771 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 15:41:27,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:41:27,771 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:41:27,771 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:41:27,771 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:41:27,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:41:27,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:41:27,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:41:27,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:41:27,772 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:41:27,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:41:27,772 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:41:27,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:41:27,773 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:41:27,773 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_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b74df92940ca0e86c8c02c3eca1e89fb6c9c9c1248a25cd764acf39f7727180 [2022-12-14 15:41:27,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:41:27,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:41:27,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:41:27,990 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:41:27,991 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:41:27,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/forester-heap/dll-circular-1.i [2022-12-14 15:41:30,679 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:41:30,908 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:41:30,908 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/sv-benchmarks/c/forester-heap/dll-circular-1.i [2022-12-14 15:41:30,917 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/data/70ae65640/59448e29233a499eaef8e7625e85a981/FLAG36ae8cc6a [2022-12-14 15:41:30,930 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/data/70ae65640/59448e29233a499eaef8e7625e85a981 [2022-12-14 15:41:30,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:41:30,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:41:30,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:41:30,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:41:30,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:41:30,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:41:30" (1/1) ... [2022-12-14 15:41:30,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49903ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:30, skipping insertion in model container [2022-12-14 15:41:30,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:41:30" (1/1) ... [2022-12-14 15:41:30,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:41:30,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:41:31,190 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/sv-benchmarks/c/forester-heap/dll-circular-1.i[22365,22378] [2022-12-14 15:41:31,196 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/sv-benchmarks/c/forester-heap/dll-circular-1.i[22471,22484] [2022-12-14 15:41:31,198 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/sv-benchmarks/c/forester-heap/dll-circular-1.i[22595,22608] [2022-12-14 15:41:31,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:41:31,211 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:41:31,238 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/sv-benchmarks/c/forester-heap/dll-circular-1.i[22365,22378] [2022-12-14 15:41:31,239 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/sv-benchmarks/c/forester-heap/dll-circular-1.i[22471,22484] [2022-12-14 15:41:31,241 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/sv-benchmarks/c/forester-heap/dll-circular-1.i[22595,22608] [2022-12-14 15:41:31,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:41:31,268 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:41:31,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:31 WrapperNode [2022-12-14 15:41:31,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:41:31,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:41:31,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:41:31,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:41:31,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:31" (1/1) ... [2022-12-14 15:41:31,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:31" (1/1) ... [2022-12-14 15:41:31,306 INFO L138 Inliner]: procedures = 119, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2022-12-14 15:41:31,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:41:31,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:41:31,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:41:31,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:41:31,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:31" (1/1) ... [2022-12-14 15:41:31,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:31" (1/1) ... [2022-12-14 15:41:31,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:31" (1/1) ... [2022-12-14 15:41:31,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:31" (1/1) ... [2022-12-14 15:41:31,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:31" (1/1) ... [2022-12-14 15:41:31,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:31" (1/1) ... [2022-12-14 15:41:31,329 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:31" (1/1) ... [2022-12-14 15:41:31,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:31" (1/1) ... [2022-12-14 15:41:31,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:41:31,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:41:31,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:41:31,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:41:31,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:31" (1/1) ... [2022-12-14 15:41:31,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:41:31,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:41:31,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:41:31,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:41:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 15:41:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 15:41:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 15:41:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:41:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 15:41:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 15:41:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:41:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 15:41:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:41:31,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:41:31,474 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:41:31,475 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:41:31,741 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:41:31,766 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:41:31,766 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-14 15:41:31,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:41:31 BoogieIcfgContainer [2022-12-14 15:41:31,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:41:31,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:41:31,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:41:31,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:41:31,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:41:30" (1/3) ... [2022-12-14 15:41:31,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e30a457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:41:31, skipping insertion in model container [2022-12-14 15:41:31,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:41:31" (2/3) ... [2022-12-14 15:41:31,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e30a457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:41:31, skipping insertion in model container [2022-12-14 15:41:31,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:41:31" (3/3) ... [2022-12-14 15:41:31,774 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2022-12-14 15:41:31,788 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:41:31,788 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-12-14 15:41:31,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:41:31,822 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;@26795a5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:41:31,823 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-12-14 15:41:31,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 45 states have (on average 2.533333333333333) internal successors, (114), 95 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 15:41:31,830 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:31,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 15:41:31,830 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:31,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash 7382, now seen corresponding path program 1 times [2022-12-14 15:41:31,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:31,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832659609] [2022-12-14 15:41:31,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:31,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:31,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-12-14 15:41:31,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:31,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832659609] [2022-12-14 15:41:31,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832659609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:31,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:31,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:41:31,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136985057] [2022-12-14 15:41:31,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:31,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:41:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:32,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:41:32,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:41:32,008 INFO L87 Difference]: Start difference. First operand has 96 states, 45 states have (on average 2.533333333333333) internal successors, (114), 95 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:32,100 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-12-14 15:41:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:41:32,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 15:41:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:32,107 INFO L225 Difference]: With dead ends: 102 [2022-12-14 15:41:32,107 INFO L226 Difference]: Without dead ends: 101 [2022-12-14 15:41:32,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:41:32,110 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:32,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 63 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-14 15:41:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2022-12-14 15:41:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 90 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-12-14 15:41:32,134 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 2 [2022-12-14 15:41:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:32,134 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-12-14 15:41:32,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-12-14 15:41:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 15:41:32,135 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:32,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 15:41:32,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:41:32,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:32,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash 7383, now seen corresponding path program 1 times [2022-12-14 15:41:32,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:32,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979543339] [2022-12-14 15:41:32,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:32,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:32,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:32,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979543339] [2022-12-14 15:41:32,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979543339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:32,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:32,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:41:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407791176] [2022-12-14 15:41:32,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:32,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:41:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:32,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:41:32,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:41:32,195 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:32,262 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-12-14 15:41:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:41:32,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 15:41:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:32,264 INFO L225 Difference]: With dead ends: 99 [2022-12-14 15:41:32,264 INFO L226 Difference]: Without dead ends: 99 [2022-12-14 15:41:32,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:41:32,265 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 81 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:32,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 66 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-12-14 15:41:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2022-12-14 15:41:32,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 45 states have (on average 2.066666666666667) internal successors, (93), 86 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2022-12-14 15:41:32,269 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 2 [2022-12-14 15:41:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:32,269 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2022-12-14 15:41:32,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-12-14 15:41:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:41:32,270 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:32,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:41:32,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:41:32,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:32,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1767036755, now seen corresponding path program 1 times [2022-12-14 15:41:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:32,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541550707] [2022-12-14 15:41:32,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:32,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:32,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:32,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541550707] [2022-12-14 15:41:32,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541550707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:32,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:32,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:41:32,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818760265] [2022-12-14 15:41:32,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:32,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:41:32,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:32,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:41:32,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:41:32,330 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:32,424 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-12-14 15:41:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:41:32,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-12-14 15:41:32,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:32,426 INFO L225 Difference]: With dead ends: 84 [2022-12-14 15:41:32,426 INFO L226 Difference]: Without dead ends: 84 [2022-12-14 15:41:32,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:41:32,427 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 130 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:32,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 42 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-14 15:41:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2022-12-14 15:41:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.8) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2022-12-14 15:41:32,433 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 6 [2022-12-14 15:41:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:32,433 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-12-14 15:41:32,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-12-14 15:41:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:41:32,433 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:32,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:41:32,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 15:41:32,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:32,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1767036754, now seen corresponding path program 1 times [2022-12-14 15:41:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:32,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210254073] [2022-12-14 15:41:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:32,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:32,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210254073] [2022-12-14 15:41:32,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210254073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:32,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:32,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:41:32,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4150772] [2022-12-14 15:41:32,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:32,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:41:32,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:32,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:41:32,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:41:32,530 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:32,627 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-12-14 15:41:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:41:32,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-12-14 15:41:32,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:32,628 INFO L225 Difference]: With dead ends: 96 [2022-12-14 15:41:32,628 INFO L226 Difference]: Without dead ends: 96 [2022-12-14 15:41:32,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:41:32,629 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 86 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:32,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 82 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-14 15:41:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2022-12-14 15:41:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.75) internal successors, (91), 81 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2022-12-14 15:41:32,636 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 6 [2022-12-14 15:41:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:32,637 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2022-12-14 15:41:32,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2022-12-14 15:41:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 15:41:32,638 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:32,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:32,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 15:41:32,638 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:32,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1610054351, now seen corresponding path program 1 times [2022-12-14 15:41:32,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:32,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467314863] [2022-12-14 15:41:32,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:32,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:32,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:32,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467314863] [2022-12-14 15:41:32,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467314863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:32,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:32,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:41:32,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989399884] [2022-12-14 15:41:32,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:32,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:41:32,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:32,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:41:32,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:41:32,772 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-12-14 15:41:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:32,857 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-12-14 15:41:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:41:32,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-12-14 15:41:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:32,858 INFO L225 Difference]: With dead ends: 81 [2022-12-14 15:41:32,858 INFO L226 Difference]: Without dead ends: 81 [2022-12-14 15:41:32,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:41:32,859 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:32,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 184 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:32,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-14 15:41:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-12-14 15:41:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 80 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2022-12-14 15:41:32,862 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 8 [2022-12-14 15:41:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:32,863 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2022-12-14 15:41:32,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-12-14 15:41:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-12-14 15:41:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 15:41:32,863 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:32,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:32,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 15:41:32,864 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:32,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:32,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1610054350, now seen corresponding path program 1 times [2022-12-14 15:41:32,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:32,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860692428] [2022-12-14 15:41:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:32,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:33,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:33,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860692428] [2022-12-14 15:41:33,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860692428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:33,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:33,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:41:33,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031848432] [2022-12-14 15:41:33,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:33,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:41:33,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:33,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:41:33,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:41:33,002 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-12-14 15:41:33,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:33,112 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-12-14 15:41:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:41:33,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-12-14 15:41:33,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:33,113 INFO L225 Difference]: With dead ends: 80 [2022-12-14 15:41:33,113 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 15:41:33,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:41:33,115 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:33,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 177 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 15:41:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-14 15:41:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 79 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-12-14 15:41:33,121 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 8 [2022-12-14 15:41:33,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:33,121 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-12-14 15:41:33,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-12-14 15:41:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-12-14 15:41:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 15:41:33,122 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:33,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:33,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 15:41:33,122 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:33,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:33,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1622353831, now seen corresponding path program 1 times [2022-12-14 15:41:33,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:33,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868886312] [2022-12-14 15:41:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:33,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:33,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:33,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868886312] [2022-12-14 15:41:33,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868886312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:33,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:33,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:41:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070465384] [2022-12-14 15:41:33,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:33,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:41:33,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:33,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:41:33,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:41:33,275 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-12-14 15:41:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:33,459 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2022-12-14 15:41:33,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:41:33,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-12-14 15:41:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:33,460 INFO L225 Difference]: With dead ends: 155 [2022-12-14 15:41:33,460 INFO L226 Difference]: Without dead ends: 155 [2022-12-14 15:41:33,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:41:33,461 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 322 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:33,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 184 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-14 15:41:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 82. [2022-12-14 15:41:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2022-12-14 15:41:33,468 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 9 [2022-12-14 15:41:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:33,468 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2022-12-14 15:41:33,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-12-14 15:41:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-12-14 15:41:33,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:41:33,469 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:33,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:33,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 15:41:33,469 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:33,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1246634621, now seen corresponding path program 1 times [2022-12-14 15:41:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:33,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989109453] [2022-12-14 15:41:33,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:33,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:33,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:33,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989109453] [2022-12-14 15:41:33,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989109453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:33,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:33,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:41:33,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201580314] [2022-12-14 15:41:33,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:33,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:41:33,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:33,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:41:33,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:41:33,634 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:33,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:33,809 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2022-12-14 15:41:33,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:41:33,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 15:41:33,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:33,811 INFO L225 Difference]: With dead ends: 117 [2022-12-14 15:41:33,811 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 15:41:33,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:41:33,811 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 196 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:33,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 113 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 15:41:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2022-12-14 15:41:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.7246376811594204) internal successors, (119), 96 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2022-12-14 15:41:33,814 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 10 [2022-12-14 15:41:33,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:33,815 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2022-12-14 15:41:33,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-12-14 15:41:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:41:33,815 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:33,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:33,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 15:41:33,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1246634620, now seen corresponding path program 1 times [2022-12-14 15:41:33,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:33,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736320843] [2022-12-14 15:41:33,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:33,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:34,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:34,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736320843] [2022-12-14 15:41:34,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736320843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:34,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:34,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:41:34,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704251185] [2022-12-14 15:41:34,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:34,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:41:34,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:34,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:41:34,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:41:34,015 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:34,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:34,232 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-12-14 15:41:34,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:41:34,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 15:41:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:34,233 INFO L225 Difference]: With dead ends: 129 [2022-12-14 15:41:34,233 INFO L226 Difference]: Without dead ends: 129 [2022-12-14 15:41:34,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:41:34,234 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 181 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:34,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 164 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:41:34,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-12-14 15:41:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 104. [2022-12-14 15:41:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.605263157894737) internal successors, (122), 103 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-12-14 15:41:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 122 transitions. [2022-12-14 15:41:34,239 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 122 transitions. Word has length 10 [2022-12-14 15:41:34,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:34,239 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 122 transitions. [2022-12-14 15:41:34,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 122 transitions. [2022-12-14 15:41:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:41:34,240 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:34,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:34,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 15:41:34,240 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:34,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:34,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1073830216, now seen corresponding path program 1 times [2022-12-14 15:41:34,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:34,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843976324] [2022-12-14 15:41:34,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:34,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:34,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:34,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843976324] [2022-12-14 15:41:34,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843976324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:34,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:34,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:41:34,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590204349] [2022-12-14 15:41:34,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:34,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:41:34,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:34,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:41:34,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:41:34,386 INFO L87 Difference]: Start difference. First operand 104 states and 122 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:34,569 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2022-12-14 15:41:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:41:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 15:41:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:34,570 INFO L225 Difference]: With dead ends: 114 [2022-12-14 15:41:34,570 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 15:41:34,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:41:34,571 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 147 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:34,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 143 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 15:41:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2022-12-14 15:41:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 102 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-12-14 15:41:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2022-12-14 15:41:34,575 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 10 [2022-12-14 15:41:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:34,575 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2022-12-14 15:41:34,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2022-12-14 15:41:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:41:34,576 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:34,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:34,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 15:41:34,577 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:34,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1073830215, now seen corresponding path program 1 times [2022-12-14 15:41:34,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:34,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179721056] [2022-12-14 15:41:34,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:34,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:34,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-12-14 15:41:34,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:34,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179721056] [2022-12-14 15:41:34,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179721056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:34,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:34,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 15:41:34,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210631476] [2022-12-14 15:41:34,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:34,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:41:34,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:34,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:41:34,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:41:34,762 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:35,015 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-12-14 15:41:35,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:41:35,015 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 15:41:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:35,016 INFO L225 Difference]: With dead ends: 108 [2022-12-14 15:41:35,016 INFO L226 Difference]: Without dead ends: 108 [2022-12-14 15:41:35,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:41:35,021 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 134 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:35,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 139 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:41:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-12-14 15:41:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2022-12-14 15:41:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2022-12-14 15:41:35,023 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 10 [2022-12-14 15:41:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:35,023 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2022-12-14 15:41:35,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2022-12-14 15:41:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:41:35,024 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:35,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:35,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 15:41:35,024 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:35,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:35,025 INFO L85 PathProgramCache]: Analyzing trace with hash 90298837, now seen corresponding path program 1 times [2022-12-14 15:41:35,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:35,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858569496] [2022-12-14 15:41:35,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:35,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:35,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:35,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858569496] [2022-12-14 15:41:35,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858569496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:35,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:35,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:41:35,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399333234] [2022-12-14 15:41:35,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:35,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:41:35,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:35,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:41:35,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:41:35,176 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:35,354 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2022-12-14 15:41:35,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:41:35,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 15:41:35,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:35,355 INFO L225 Difference]: With dead ends: 123 [2022-12-14 15:41:35,355 INFO L226 Difference]: Without dead ends: 123 [2022-12-14 15:41:35,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:41:35,356 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 236 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:35,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 148 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-12-14 15:41:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2022-12-14 15:41:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 95 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-12-14 15:41:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-12-14 15:41:35,360 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 13 [2022-12-14 15:41:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:35,360 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-12-14 15:41:35,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-12-14 15:41:35,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:41:35,361 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:35,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:35,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 15:41:35,361 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:35,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:35,362 INFO L85 PathProgramCache]: Analyzing trace with hash 90298838, now seen corresponding path program 1 times [2022-12-14 15:41:35,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:35,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429627897] [2022-12-14 15:41:35,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:35,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:35,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-12-14 15:41:35,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:35,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429627897] [2022-12-14 15:41:35,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429627897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:35,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:35,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:41:35,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530728964] [2022-12-14 15:41:35,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:35,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:41:35,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:35,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:41:35,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:41:35,562 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:35,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:35,740 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2022-12-14 15:41:35,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:41:35,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 15:41:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:35,740 INFO L225 Difference]: With dead ends: 135 [2022-12-14 15:41:35,740 INFO L226 Difference]: Without dead ends: 135 [2022-12-14 15:41:35,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:41:35,741 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 228 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:35,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 138 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:35,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-12-14 15:41:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 96. [2022-12-14 15:41:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 95 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2022-12-14 15:41:35,745 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 13 [2022-12-14 15:41:35,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:35,745 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2022-12-14 15:41:35,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2022-12-14 15:41:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 15:41:35,746 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:35,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:35,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 15:41:35,746 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:35,746 INFO L85 PathProgramCache]: Analyzing trace with hash -939797720, now seen corresponding path program 1 times [2022-12-14 15:41:35,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:35,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947843861] [2022-12-14 15:41:35,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:35,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:35,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:35,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947843861] [2022-12-14 15:41:35,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947843861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:35,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:35,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:41:35,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677981531] [2022-12-14 15:41:35,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:35,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:41:35,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:35,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:41:35,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:41:35,834 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:35,903 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2022-12-14 15:41:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:41:35,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-12-14 15:41:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:35,904 INFO L225 Difference]: With dead ends: 94 [2022-12-14 15:41:35,904 INFO L226 Difference]: Without dead ends: 94 [2022-12-14 15:41:35,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:41:35,905 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 156 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:35,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 70 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-12-14 15:41:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-12-14 15:41:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.527027027027027) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2022-12-14 15:41:35,908 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 14 [2022-12-14 15:41:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:35,908 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2022-12-14 15:41:35,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-12-14 15:41:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:41:35,909 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:35,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:35,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 15:41:35,909 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:35,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:35,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1473390987, now seen corresponding path program 1 times [2022-12-14 15:41:35,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:35,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922741142] [2022-12-14 15:41:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:36,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:36,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922741142] [2022-12-14 15:41:36,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922741142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:36,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:36,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:41:36,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653888192] [2022-12-14 15:41:36,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:36,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:41:36,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:36,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:41:36,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:41:36,051 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:36,173 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2022-12-14 15:41:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:41:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:41:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:36,174 INFO L225 Difference]: With dead ends: 135 [2022-12-14 15:41:36,174 INFO L226 Difference]: Without dead ends: 135 [2022-12-14 15:41:36,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:41:36,175 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 184 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:36,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 147 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-12-14 15:41:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2022-12-14 15:41:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 96 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2022-12-14 15:41:36,177 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 16 [2022-12-14 15:41:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:36,177 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2022-12-14 15:41:36,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2022-12-14 15:41:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:41:36,178 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:36,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:36,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 15:41:36,178 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:36,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:36,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1445707782, now seen corresponding path program 1 times [2022-12-14 15:41:36,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:36,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039301563] [2022-12-14 15:41:36,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:36,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:36,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:36,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039301563] [2022-12-14 15:41:36,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039301563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:36,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:36,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 15:41:36,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756792164] [2022-12-14 15:41:36,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:36,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 15:41:36,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:36,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 15:41:36,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:41:36,434 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:36,730 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-12-14 15:41:36,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:41:36,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:41:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:36,731 INFO L225 Difference]: With dead ends: 112 [2022-12-14 15:41:36,731 INFO L226 Difference]: Without dead ends: 112 [2022-12-14 15:41:36,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:41:36,732 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 164 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:36,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 222 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:41:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-14 15:41:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2022-12-14 15:41:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 96 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2022-12-14 15:41:36,735 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 16 [2022-12-14 15:41:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:36,735 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2022-12-14 15:41:36,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2022-12-14 15:41:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:41:36,736 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:36,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:36,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 15:41:36,736 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:36,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1569446747, now seen corresponding path program 1 times [2022-12-14 15:41:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:36,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855680337] [2022-12-14 15:41:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41: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-12-14 15:41:36,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:36,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855680337] [2022-12-14 15:41:36,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855680337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:36,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:36,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:41:36,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036655183] [2022-12-14 15:41:36,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:36,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:41:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:36,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:41:36,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:41:36,876 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:37,040 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2022-12-14 15:41:37,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:41:37,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:41:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:37,041 INFO L225 Difference]: With dead ends: 140 [2022-12-14 15:41:37,041 INFO L226 Difference]: Without dead ends: 140 [2022-12-14 15:41:37,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:41:37,042 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 221 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:37,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 189 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:37,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-12-14 15:41:37,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2022-12-14 15:41:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.475) internal successors, (118), 99 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2022-12-14 15:41:37,045 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 17 [2022-12-14 15:41:37,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:37,045 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2022-12-14 15:41:37,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2022-12-14 15:41:37,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:41:37,046 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:37,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:37,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 15:41:37,046 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:37,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:37,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1866896108, now seen corresponding path program 1 times [2022-12-14 15:41:37,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:37,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135887004] [2022-12-14 15:41:37,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:37,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:37,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:37,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135887004] [2022-12-14 15:41:37,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135887004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:37,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:37,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:41:37,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767006057] [2022-12-14 15:41:37,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:37,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:41:37,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:37,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:41:37,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:41:37,249 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:37,423 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2022-12-14 15:41:37,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:41:37,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:41:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:37,424 INFO L225 Difference]: With dead ends: 120 [2022-12-14 15:41:37,424 INFO L226 Difference]: Without dead ends: 120 [2022-12-14 15:41:37,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:41:37,425 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 213 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:37,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 163 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-14 15:41:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2022-12-14 15:41:37,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 103 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-12-14 15:41:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2022-12-14 15:41:37,428 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 17 [2022-12-14 15:41:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:37,428 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2022-12-14 15:41:37,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2022-12-14 15:41:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:41:37,429 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:37,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:37,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 15:41:37,429 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:37,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:37,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1866896109, now seen corresponding path program 1 times [2022-12-14 15:41:37,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:37,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280951644] [2022-12-14 15:41:37,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:37,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:37,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:37,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280951644] [2022-12-14 15:41:37,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280951644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:37,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:37,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:41:37,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203582126] [2022-12-14 15:41:37,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:37,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:41:37,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:37,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:41:37,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:41:37,630 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:37,839 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-12-14 15:41:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:41:37,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:41:37,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:37,840 INFO L225 Difference]: With dead ends: 131 [2022-12-14 15:41:37,840 INFO L226 Difference]: Without dead ends: 131 [2022-12-14 15:41:37,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:41:37,841 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 127 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:37,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 175 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:41:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-14 15:41:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 104. [2022-12-14 15:41:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 103 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-12-14 15:41:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 122 transitions. [2022-12-14 15:41:37,844 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 122 transitions. Word has length 17 [2022-12-14 15:41:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:37,844 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 122 transitions. [2022-12-14 15:41:37,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 122 transitions. [2022-12-14 15:41:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:41:37,845 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:37,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:37,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 15:41:37,845 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:37,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:37,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1867332820, now seen corresponding path program 1 times [2022-12-14 15:41:37,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:37,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111312206] [2022-12-14 15:41:37,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:37,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:37,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:37,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111312206] [2022-12-14 15:41:37,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111312206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:37,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:37,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:41:37,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76423333] [2022-12-14 15:41:37,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:37,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:41:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:37,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:41:37,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:41:37,874 INFO L87 Difference]: Start difference. First operand 104 states and 122 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:37,909 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2022-12-14 15:41:37,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:41:37,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:41:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:37,912 INFO L225 Difference]: With dead ends: 164 [2022-12-14 15:41:37,912 INFO L226 Difference]: Without dead ends: 164 [2022-12-14 15:41:37,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:41:37,912 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 55 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:37,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 107 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:41:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-12-14 15:41:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 116. [2022-12-14 15:41:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 115 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-12-14 15:41:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 136 transitions. [2022-12-14 15:41:37,916 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 136 transitions. Word has length 17 [2022-12-14 15:41:37,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:37,916 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 136 transitions. [2022-12-14 15:41:37,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 136 transitions. [2022-12-14 15:41:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 15:41:37,917 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:37,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:37,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 15:41:37,917 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:37,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:37,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1410461874, now seen corresponding path program 1 times [2022-12-14 15:41:37,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:37,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792785140] [2022-12-14 15:41:37,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:37,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:38,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:38,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792785140] [2022-12-14 15:41:38,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792785140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:38,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:41:38,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:41:38,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204122861] [2022-12-14 15:41:38,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:38,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:41:38,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:38,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:41:38,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:41:38,046 INFO L87 Difference]: Start difference. First operand 116 states and 136 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:38,210 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2022-12-14 15:41:38,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:41:38,211 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 15:41:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:38,212 INFO L225 Difference]: With dead ends: 130 [2022-12-14 15:41:38,212 INFO L226 Difference]: Without dead ends: 126 [2022-12-14 15:41:38,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:41:38,213 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 135 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:38,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 196 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:38,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-12-14 15:41:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2022-12-14 15:41:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 113 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-12-14 15:41:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2022-12-14 15:41:38,221 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 18 [2022-12-14 15:41:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:38,221 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2022-12-14 15:41:38,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2022-12-14 15:41:38,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:41:38,222 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:38,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:38,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 15:41:38,222 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:38,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash -704795978, now seen corresponding path program 1 times [2022-12-14 15:41:38,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:38,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720560017] [2022-12-14 15:41:38,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:38,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:38,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:41:38,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720560017] [2022-12-14 15:41:38,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720560017] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:41:38,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503178903] [2022-12-14 15:41:38,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:38,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:41:38,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:41:38,611 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:41:38,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:41:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:41:38,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 15:41:38,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:41:38,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-12-14 15:41:38,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-12-14 15:41:38,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 15:41:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:41:38,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:41:38,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503178903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:41:38,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:41:38,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 15 [2022-12-14 15:41:38,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349920270] [2022-12-14 15:41:38,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:41:38,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:41:38,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:41:38,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:41:38,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:41:38,812 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:41:38,989 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2022-12-14 15:41:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:41:38,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 15:41:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:41:38,990 INFO L225 Difference]: With dead ends: 156 [2022-12-14 15:41:38,990 INFO L226 Difference]: Without dead ends: 153 [2022-12-14 15:41:38,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:41:38,991 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 71 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:41:38,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 194 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:41:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-12-14 15:41:38,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 106. [2022-12-14 15:41:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 105 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2022-12-14 15:41:38,994 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 19 [2022-12-14 15:41:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:41:38,994 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2022-12-14 15:41:38,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:41:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2022-12-14 15:41:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:41:38,995 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:41:38,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:39,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:41:39,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 15:41:39,196 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-12-14 15:41:39,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:41:39,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1209091334, now seen corresponding path program 1 times [2022-12-14 15:41:39,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:41:39,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638877523] [2022-12-14 15:41:39,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:41:39,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:41:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 15:41:39,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 15:41:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 15:41:39,336 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 15:41:39,336 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 15:41:39,338 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (49 of 50 remaining) [2022-12-14 15:41:39,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2022-12-14 15:41:39,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2022-12-14 15:41:39,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2022-12-14 15:41:39,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2022-12-14 15:41:39,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2022-12-14 15:41:39,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2022-12-14 15:41:39,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2022-12-14 15:41:39,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2022-12-14 15:41:39,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2022-12-14 15:41:39,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2022-12-14 15:41:39,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2022-12-14 15:41:39,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2022-12-14 15:41:39,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2022-12-14 15:41:39,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2022-12-14 15:41:39,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2022-12-14 15:41:39,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2022-12-14 15:41:39,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (32 of 50 remaining) [2022-12-14 15:41:39,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2022-12-14 15:41:39,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2022-12-14 15:41:39,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2022-12-14 15:41:39,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2022-12-14 15:41:39,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (27 of 50 remaining) [2022-12-14 15:41:39,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2022-12-14 15:41:39,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2022-12-14 15:41:39,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2022-12-14 15:41:39,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2022-12-14 15:41:39,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2022-12-14 15:41:39,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2022-12-14 15:41:39,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2022-12-14 15:41:39,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2022-12-14 15:41:39,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2022-12-14 15:41:39,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2022-12-14 15:41:39,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2022-12-14 15:41:39,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2022-12-14 15:41:39,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2022-12-14 15:41:39,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2022-12-14 15:41:39,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2022-12-14 15:41:39,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2022-12-14 15:41:39,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2022-12-14 15:41:39,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2022-12-14 15:41:39,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2022-12-14 15:41:39,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2022-12-14 15:41:39,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (6 of 50 remaining) [2022-12-14 15:41:39,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (5 of 50 remaining) [2022-12-14 15:41:39,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (4 of 50 remaining) [2022-12-14 15:41:39,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (3 of 50 remaining) [2022-12-14 15:41:39,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (2 of 50 remaining) [2022-12-14 15:41:39,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (1 of 50 remaining) [2022-12-14 15:41:39,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK (0 of 50 remaining) [2022-12-14 15:41:39,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 15:41:39,355 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:41:39,360 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 15:41:39,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:41:39 BoogieIcfgContainer [2022-12-14 15:41:39,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 15:41:39,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 15:41:39,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 15:41:39,384 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 15:41:39,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:41:31" (3/4) ... [2022-12-14 15:41:39,386 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 15:41:39,414 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 15:41:39,414 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 15:41:39,414 INFO L158 Benchmark]: Toolchain (without parser) took 8479.92ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 137.0MB in the beginning and 159.3MB in the end (delta: -22.4MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2022-12-14 15:41:39,414 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 178.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:41:39,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.17ms. Allocated memory is still 201.3MB. Free memory was 136.8MB in the beginning and 119.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 15:41:39,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.60ms. Allocated memory is still 201.3MB. Free memory was 119.1MB in the beginning and 117.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:41:39,415 INFO L158 Benchmark]: Boogie Preprocessor took 25.05ms. Allocated memory is still 201.3MB. Free memory was 117.0MB in the beginning and 115.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:41:39,415 INFO L158 Benchmark]: RCFGBuilder took 436.09ms. Allocated memory is still 201.3MB. Free memory was 115.2MB in the beginning and 158.7MB in the end (delta: -43.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2022-12-14 15:41:39,415 INFO L158 Benchmark]: TraceAbstraction took 7613.09ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 157.7MB in the beginning and 161.4MB in the end (delta: -3.7MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2022-12-14 15:41:39,415 INFO L158 Benchmark]: Witness Printer took 30.32ms. Allocated memory is still 243.3MB. Free memory was 161.4MB in the beginning and 159.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:41:39,416 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.19ms. Allocated memory is still 201.3MB. Free memory is still 178.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.17ms. Allocated memory is still 201.3MB. Free memory was 136.8MB in the beginning and 119.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.60ms. Allocated memory is still 201.3MB. Free memory was 119.1MB in the beginning and 117.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.05ms. Allocated memory is still 201.3MB. Free memory was 117.0MB in the beginning and 115.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 436.09ms. Allocated memory is still 201.3MB. Free memory was 115.2MB in the beginning and 158.7MB in the end (delta: -43.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7613.09ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 157.7MB in the beginning and 161.4MB in the end (delta: -3.7MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * Witness Printer took 30.32ms. Allocated memory is still 243.3MB. Free memory was 161.4MB in the beginning and 159.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1034]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = head VAL [head={-1:0}] [L999] head->data = 0 [L1001] SLL* x = head; [L1002] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1027] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1029] EXPR head->next [L1029] x = head->next [L1030] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1032] COND TRUE x->data != 0 [L1034] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1034] EXPR x->next->data [L1034] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->next->data [L1034] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1034] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1034] reach_error() VAL [head={-1:0}, state=1, x={-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: 1025]: 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: 1030]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: 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, 96 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3159 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3159 mSDsluCounter, 3106 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2153 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3493 IncrementalHoareTripleChecker+Invalid, 3717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 953 mSDtfsCounter, 3493 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=20, InterpolantAutomatonStates: 155, 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, 22 MinimizatonAttempts, 498 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 3193 SizeOfPredicates, 8 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 23 InterpolantComputations, 22 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 15:41:39,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308368cc-a9f0-475f-8b4c-a6e96f8c0503/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)