./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/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_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/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_4ebf79e0-4bdd-44ec-863c-5a66727ec222/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 4bb6c46a4de77c33ebd5db0d25fe513601ef52929336922ed8d1cb2e429dd77c --- 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 08:13:33,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 08:13:33,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 08:13:33,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 08:13:33,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 08:13:33,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 08:13:33,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 08:13:33,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 08:13:33,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 08:13:33,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 08:13:33,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 08:13:33,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 08:13:33,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 08:13:33,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 08:13:33,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 08:13:33,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 08:13:33,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 08:13:33,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 08:13:33,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 08:13:33,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 08:13:33,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 08:13:33,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 08:13:33,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 08:13:33,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 08:13:33,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 08:13:33,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 08:13:33,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 08:13:33,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 08:13:33,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 08:13:33,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 08:13:33,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 08:13:33,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 08:13:33,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 08:13:33,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 08:13:33,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 08:13:33,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 08:13:33,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 08:13:33,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 08:13:33,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 08:13:33,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 08:13:33,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 08:13:33,939 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-12-14 08:13:33,954 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 08:13:33,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 08:13:33,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 08:13:33,955 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 08:13:33,956 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 08:13:33,956 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 08:13:33,956 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 08:13:33,956 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 08:13:33,956 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 08:13:33,956 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 08:13:33,957 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 08:13:33,957 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 08:13:33,957 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 08:13:33,957 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 08:13:33,957 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 08:13:33,957 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 08:13:33,957 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 08:13:33,958 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 08:13:33,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 08:13:33,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 08:13:33,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 08:13:33,959 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 08:13:33,959 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 08:13:33,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 08:13:33,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 08:13:33,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 08:13:33,960 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 08:13:33,960 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 08:13:33,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 08:13:33,960 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 08:13:33,960 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 08:13:33,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 08:13:33,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 08:13:33,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 08:13:33,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:13:33,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 08:13:33,961 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 08:13:33,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 08:13:33,962 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 08:13:33,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 08:13:33,962 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 08:13:33,962 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_4ebf79e0-4bdd-44ec-863c-5a66727ec222/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_4ebf79e0-4bdd-44ec-863c-5a66727ec222/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 -> 4bb6c46a4de77c33ebd5db0d25fe513601ef52929336922ed8d1cb2e429dd77c [2022-12-14 08:13:34,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 08:13:34,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 08:13:34,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 08:13:34,163 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 08:13:34,163 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 08:13:34,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2022-12-14 08:13:36,835 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 08:13:37,026 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 08:13:37,027 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2022-12-14 08:13:37,037 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/data/f5bed32f2/fcd351ad0b17471f9985baf968461783/FLAG5a9e8d70f [2022-12-14 08:13:37,051 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/data/f5bed32f2/fcd351ad0b17471f9985baf968461783 [2022-12-14 08:13:37,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 08:13:37,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 08:13:37,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 08:13:37,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 08:13:37,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 08:13:37,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:13:37" (1/1) ... [2022-12-14 08:13:37,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258dfb36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37, skipping insertion in model container [2022-12-14 08:13:37,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:13:37" (1/1) ... [2022-12-14 08:13:37,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 08:13:37,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 08:13:37,313 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_4ebf79e0-4bdd-44ec-863c-5a66727ec222/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i[22793,22806] [2022-12-14 08:13:37,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:13:37,327 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 08:13:37,353 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_4ebf79e0-4bdd-44ec-863c-5a66727ec222/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i[22793,22806] [2022-12-14 08:13:37,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:13:37,371 INFO L208 MainTranslator]: Completed translation [2022-12-14 08:13:37,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37 WrapperNode [2022-12-14 08:13:37,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 08:13:37,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 08:13:37,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 08:13:37,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 08:13:37,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37" (1/1) ... [2022-12-14 08:13:37,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37" (1/1) ... [2022-12-14 08:13:37,402 INFO L138 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2022-12-14 08:13:37,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 08:13:37,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 08:13:37,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 08:13:37,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 08:13:37,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37" (1/1) ... [2022-12-14 08:13:37,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37" (1/1) ... [2022-12-14 08:13:37,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37" (1/1) ... [2022-12-14 08:13:37,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37" (1/1) ... [2022-12-14 08:13:37,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37" (1/1) ... [2022-12-14 08:13:37,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37" (1/1) ... [2022-12-14 08:13:37,422 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37" (1/1) ... [2022-12-14 08:13:37,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37" (1/1) ... [2022-12-14 08:13:37,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 08:13:37,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 08:13:37,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 08:13:37,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 08:13:37,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37" (1/1) ... [2022-12-14 08:13:37,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:13:37,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:13:37,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 08:13:37,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 08:13:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 08:13:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 08:13:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 08:13:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 08:13:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 08:13:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 08:13:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 08:13:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 08:13:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 08:13:37,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 08:13:37,567 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 08:13:37,569 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 08:13:37,889 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 08:13:37,934 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 08:13:37,934 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-14 08:13:37,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:13:37 BoogieIcfgContainer [2022-12-14 08:13:37,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 08:13:37,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 08:13:37,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 08:13:37,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 08:13:37,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 08:13:37" (1/3) ... [2022-12-14 08:13:37,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83671ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:13:37, skipping insertion in model container [2022-12-14 08:13:37,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:13:37" (2/3) ... [2022-12-14 08:13:37,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83671ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:13:37, skipping insertion in model container [2022-12-14 08:13:37,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:13:37" (3/3) ... [2022-12-14 08:13:37,945 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-1.i [2022-12-14 08:13:37,964 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 08:13:37,964 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-12-14 08:13:38,005 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 08:13:38,009 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;@57f4b5ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 08:13:38,009 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-12-14 08:13:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 47 states have (on average 2.595744680851064) internal successors, (122), 108 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 08:13:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 08:13:38,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:38,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 08:13:38,026 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:38,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:38,032 INFO L85 PathProgramCache]: Analyzing trace with hash 7754, now seen corresponding path program 1 times [2022-12-14 08:13:38,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:38,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971681523] [2022-12-14 08:13:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:38,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 08:13:38,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:38,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971681523] [2022-12-14 08:13:38,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971681523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:38,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:38,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 08:13:38,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256009671] [2022-12-14 08:13:38,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:38,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:13:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:38,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:13:38,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:13:38,203 INFO L87 Difference]: Start difference. First operand has 109 states, 47 states have (on average 2.595744680851064) internal successors, (122), 108 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) 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 08:13:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:38,313 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-12-14 08:13:38,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:13:38,315 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 08:13:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:38,321 INFO L225 Difference]: With dead ends: 109 [2022-12-14 08:13:38,321 INFO L226 Difference]: Without dead ends: 107 [2022-12-14 08:13:38,322 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 08:13:38,324 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 97 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:38,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 51 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:13:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-12-14 08:13:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2022-12-14 08:13:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 103 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 08:13:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2022-12-14 08:13:38,350 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 2 [2022-12-14 08:13:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:38,350 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2022-12-14 08:13:38,351 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 08:13:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2022-12-14 08:13:38,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 08:13:38,351 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:38,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 08:13:38,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 08:13:38,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:38,352 INFO L85 PathProgramCache]: Analyzing trace with hash 7755, now seen corresponding path program 1 times [2022-12-14 08:13:38,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:38,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647957331] [2022-12-14 08:13:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:38,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:38,411 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 08:13:38,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:38,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647957331] [2022-12-14 08:13:38,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647957331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:38,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:38,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 08:13:38,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006089171] [2022-12-14 08:13:38,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:38,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:13:38,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:38,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:13:38,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:13:38,414 INFO L87 Difference]: Start difference. First operand 104 states and 111 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 08:13:38,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:38,517 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2022-12-14 08:13:38,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:13:38,518 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 08:13:38,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:38,519 INFO L225 Difference]: With dead ends: 116 [2022-12-14 08:13:38,519 INFO L226 Difference]: Without dead ends: 116 [2022-12-14 08:13:38,520 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 08:13:38,520 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:38,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 123 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:13:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-12-14 08:13:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2022-12-14 08:13:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 46 states have (on average 2.347826086956522) internal successors, (108), 100 states have internal predecessors, (108), 0 states have call successors, (0), 0 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 08:13:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2022-12-14 08:13:38,526 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 2 [2022-12-14 08:13:38,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:38,526 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2022-12-14 08:13:38,526 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 08:13:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-12-14 08:13:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 08:13:38,527 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:38,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:13:38,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 08:13:38,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:38,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:38,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1364528455, now seen corresponding path program 1 times [2022-12-14 08:13:38,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:38,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615562150] [2022-12-14 08:13:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:38,653 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 08:13:38,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:38,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615562150] [2022-12-14 08:13:38,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615562150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:38,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:38,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:13:38,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892716301] [2022-12-14 08:13:38,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:38,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:13:38,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:38,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:13:38,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:13:38,655 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:38,777 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-12-14 08:13:38,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:13:38,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 08:13:38,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:38,778 INFO L225 Difference]: With dead ends: 99 [2022-12-14 08:13:38,779 INFO L226 Difference]: Without dead ends: 99 [2022-12-14 08:13:38,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:13:38,780 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 140 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:38,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 30 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:13:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-12-14 08:13:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2022-12-14 08:13:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 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 08:13:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-12-14 08:13:38,787 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 7 [2022-12-14 08:13:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:38,787 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-12-14 08:13:38,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-12-14 08:13:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 08:13:38,788 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:38,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:13:38,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 08:13:38,788 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:38,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:38,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1364528454, now seen corresponding path program 1 times [2022-12-14 08:13:38,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:38,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491919592] [2022-12-14 08:13:38,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:38,952 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 08:13:38,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:38,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491919592] [2022-12-14 08:13:38,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491919592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:38,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:38,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:13:38,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904253680] [2022-12-14 08:13:38,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:38,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:13:38,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:38,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:13:38,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:13:38,954 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:39,159 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2022-12-14 08:13:39,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:13:39,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 08:13:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:39,160 INFO L225 Difference]: With dead ends: 115 [2022-12-14 08:13:39,160 INFO L226 Difference]: Without dead ends: 115 [2022-12-14 08:13:39,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:13:39,161 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 125 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:39,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 53 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:13:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-12-14 08:13:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2022-12-14 08:13:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.75) internal successors, (119), 103 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 08:13:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2022-12-14 08:13:39,166 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 7 [2022-12-14 08:13:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:39,166 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2022-12-14 08:13:39,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2022-12-14 08:13:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 08:13:39,167 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:39,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:13:39,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 08:13:39,167 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:39,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1346627867, now seen corresponding path program 1 times [2022-12-14 08:13:39,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:39,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755840241] [2022-12-14 08:13:39,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:39,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:39,323 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 08:13:39,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:39,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755840241] [2022-12-14 08:13:39,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755840241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:39,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:39,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:13:39,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494438805] [2022-12-14 08:13:39,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:39,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:13:39,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:39,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:13:39,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:13:39,324 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:39,445 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2022-12-14 08:13:39,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:13:39,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 08:13:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:39,446 INFO L225 Difference]: With dead ends: 103 [2022-12-14 08:13:39,446 INFO L226 Difference]: Without dead ends: 103 [2022-12-14 08:13:39,446 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 08:13:39,447 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:39,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 156 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:13:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-14 08:13:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-12-14 08:13:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 102 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 08:13:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2022-12-14 08:13:39,451 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 9 [2022-12-14 08:13:39,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:39,451 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2022-12-14 08:13:39,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2022-12-14 08:13:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 08:13:39,451 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:39,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:13:39,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 08:13:39,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1346627868, now seen corresponding path program 1 times [2022-12-14 08:13:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:39,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036944107] [2022-12-14 08:13:39,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:39,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:39,534 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 08:13:39,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:39,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036944107] [2022-12-14 08:13:39,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036944107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:39,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:39,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:13:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628040913] [2022-12-14 08:13:39,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:39,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:13:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:13:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:13:39,537 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:39,638 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-12-14 08:13:39,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:13:39,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 08:13:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:39,639 INFO L225 Difference]: With dead ends: 102 [2022-12-14 08:13:39,639 INFO L226 Difference]: Without dead ends: 102 [2022-12-14 08:13:39,639 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 08:13:39,640 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:39,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 168 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:13:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-14 08:13:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-12-14 08:13:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.6911764705882353) internal successors, (115), 101 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 08:13:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2022-12-14 08:13:39,645 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 9 [2022-12-14 08:13:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:39,645 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2022-12-14 08:13:39,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2022-12-14 08:13:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 08:13:39,646 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:39,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:13:39,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 08:13:39,646 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:39,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1324031821, now seen corresponding path program 1 times [2022-12-14 08:13:39,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:39,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919429027] [2022-12-14 08:13:39,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:39,792 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 08:13:39,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:39,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919429027] [2022-12-14 08:13:39,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919429027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:39,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:39,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 08:13:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447496462] [2022-12-14 08:13:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:39,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:13:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:39,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:13:39,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:13:39,794 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:39,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:39,998 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-12-14 08:13:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:13:39,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 08:13:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:39,999 INFO L225 Difference]: With dead ends: 105 [2022-12-14 08:13:39,999 INFO L226 Difference]: Without dead ends: 105 [2022-12-14 08:13:39,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-14 08:13:40,000 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 129 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:40,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 85 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:13:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-14 08:13:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2022-12-14 08:13:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 100 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 08:13:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2022-12-14 08:13:40,005 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 11 [2022-12-14 08:13:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:40,006 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2022-12-14 08:13:40,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2022-12-14 08:13:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 08:13:40,006 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:40,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:13:40,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 08:13:40,007 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:40,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:40,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1324031820, now seen corresponding path program 1 times [2022-12-14 08:13:40,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:40,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228003288] [2022-12-14 08:13:40,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:40,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:40,207 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 08:13:40,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:40,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228003288] [2022-12-14 08:13:40,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228003288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:40,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:40,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 08:13:40,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961337317] [2022-12-14 08:13:40,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:40,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 08:13:40,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:40,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 08:13:40,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-14 08:13:40,209 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:40,564 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-12-14 08:13:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 08:13:40,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 08:13:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:40,565 INFO L225 Difference]: With dead ends: 102 [2022-12-14 08:13:40,565 INFO L226 Difference]: Without dead ends: 102 [2022-12-14 08:13:40,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-12-14 08:13:40,566 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 126 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:40,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 131 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:13:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-14 08:13:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2022-12-14 08:13:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 08:13:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2022-12-14 08:13:40,571 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 11 [2022-12-14 08:13:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:40,572 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2022-12-14 08:13:40,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2022-12-14 08:13:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 08:13:40,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:40,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:13:40,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 08:13:40,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1004879300, now seen corresponding path program 1 times [2022-12-14 08:13:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:40,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138604715] [2022-12-14 08:13:40,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:40,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:40,696 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 08:13:40,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:40,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138604715] [2022-12-14 08:13:40,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138604715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:40,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:40,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:13:40,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619017280] [2022-12-14 08:13:40,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:40,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:13:40,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:40,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:13:40,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:13:40,698 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:40,822 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-12-14 08:13:40,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 08:13:40,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 08:13:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:40,823 INFO L225 Difference]: With dead ends: 100 [2022-12-14 08:13:40,823 INFO L226 Difference]: Without dead ends: 100 [2022-12-14 08:13:40,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:13:40,824 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 17 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:40,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:13:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-14 08:13:40,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-12-14 08:13:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.6176470588235294) internal successors, (110), 95 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 08:13:40,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2022-12-14 08:13:40,827 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 13 [2022-12-14 08:13:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:40,827 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2022-12-14 08:13:40,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2022-12-14 08:13:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 08:13:40,827 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:40,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:13:40,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 08:13:40,827 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1084223849, now seen corresponding path program 1 times [2022-12-14 08:13:40,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:40,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464445400] [2022-12-14 08:13:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:40,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:40,882 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 08:13:40,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:40,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464445400] [2022-12-14 08:13:40,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464445400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:40,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:40,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:13:40,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175618379] [2022-12-14 08:13:40,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:40,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:13:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:40,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:13:40,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:13:40,884 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 5 states, 4 states have (on average 3.5) 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 08:13:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:40,997 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2022-12-14 08:13:40,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:13:40,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) 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 08:13:40,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:40,997 INFO L225 Difference]: With dead ends: 95 [2022-12-14 08:13:40,997 INFO L226 Difference]: Without dead ends: 95 [2022-12-14 08:13:40,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:13:40,998 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 43 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:40,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 93 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:13:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-14 08:13:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-12-14 08:13:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.6029411764705883) internal successors, (109), 94 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 08:13:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2022-12-14 08:13:41,001 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 14 [2022-12-14 08:13:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:41,001 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2022-12-14 08:13:41,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) 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 08:13:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2022-12-14 08:13:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 08:13:41,001 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:41,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:13:41,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 08:13:41,001 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1084223848, now seen corresponding path program 1 times [2022-12-14 08:13:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:41,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610491823] [2022-12-14 08:13:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:41,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:41,097 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 08:13:41,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:41,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610491823] [2022-12-14 08:13:41,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610491823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:41,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:41,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:13:41,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342488639] [2022-12-14 08:13:41,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:41,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:13:41,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:41,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:13:41,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:13:41,099 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 5 states, 4 states have (on average 3.5) 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 08:13:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:41,213 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2022-12-14 08:13:41,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:13:41,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) 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 08:13:41,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:41,214 INFO L225 Difference]: With dead ends: 92 [2022-12-14 08:13:41,214 INFO L226 Difference]: Without dead ends: 92 [2022-12-14 08:13:41,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:13:41,215 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:41,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 123 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:13:41,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-14 08:13:41,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-12-14 08:13:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 91 states have internal predecessors, (106), 0 states have call successors, (0), 0 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 08:13:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2022-12-14 08:13:41,219 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 14 [2022-12-14 08:13:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:41,219 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2022-12-14 08:13:41,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) 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 08:13:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2022-12-14 08:13:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 08:13:41,220 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:41,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:13:41,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 08:13:41,220 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:41,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:41,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1203608841, now seen corresponding path program 1 times [2022-12-14 08:13:41,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:41,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454200561] [2022-12-14 08:13:41,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:41,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:41,433 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 08:13:41,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:41,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454200561] [2022-12-14 08:13:41,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454200561] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:13:41,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389101911] [2022-12-14 08:13:41,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:41,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:13:41,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:13:41,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:13:41,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 08:13:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:41,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 08:13:41,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:13:41,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 08:13:41,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:13:41,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 08:13:41,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 08:13:41,641 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 08:13:41,654 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 08:13:41,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:13:41,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389101911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:41,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:13:41,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2022-12-14 08:13:41,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424009760] [2022-12-14 08:13:41,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:41,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:13:41,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:41,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:13:41,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-14 08:13:41,656 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 6 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 08:13:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:41,766 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-12-14 08:13:41,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:13:41,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 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 08:13:41,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:41,767 INFO L225 Difference]: With dead ends: 116 [2022-12-14 08:13:41,767 INFO L226 Difference]: Without dead ends: 116 [2022-12-14 08:13:41,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-12-14 08:13:41,767 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 35 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:41,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 119 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:13:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-12-14 08:13:41,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2022-12-14 08:13:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 94 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 08:13:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2022-12-14 08:13:41,769 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 16 [2022-12-14 08:13:41,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:41,769 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2022-12-14 08:13:41,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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 08:13:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2022-12-14 08:13:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 08:13:41,770 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:41,770 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 08:13:41,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 08:13:41,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:13:41,971 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:41,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1342877752, now seen corresponding path program 1 times [2022-12-14 08:13:41,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:41,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008691483] [2022-12-14 08:13:41,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:41,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:42,101 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 08:13:42,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:42,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008691483] [2022-12-14 08:13:42,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008691483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:42,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:42,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:13:42,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736901090] [2022-12-14 08:13:42,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:42,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 08:13:42,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:42,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 08:13:42,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:13:42,103 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) 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 08:13:42,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:42,274 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-12-14 08:13:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 08:13:42,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) 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 08:13:42,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:42,275 INFO L225 Difference]: With dead ends: 117 [2022-12-14 08:13:42,275 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 08:13:42,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-12-14 08:13:42,276 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 170 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:42,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 58 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:13:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 08:13:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 95. [2022-12-14 08:13:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 94 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 08:13:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2022-12-14 08:13:42,280 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 17 [2022-12-14 08:13:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:42,280 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2022-12-14 08:13:42,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) 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 08:13:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2022-12-14 08:13:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 08:13:42,280 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:42,280 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 08:13:42,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 08:13:42,281 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:42,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:42,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1342877751, now seen corresponding path program 1 times [2022-12-14 08:13:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:42,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671756761] [2022-12-14 08:13:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:42,482 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 08:13:42,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:42,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671756761] [2022-12-14 08:13:42,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671756761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:42,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:42,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:13:42,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819840129] [2022-12-14 08:13:42,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:42,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:13:42,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:42,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:13:42,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:13:42,483 INFO L87 Difference]: Start difference. First operand 95 states and 110 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 08:13:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:42,864 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2022-12-14 08:13:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 08:13:42,864 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 08:13:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:42,865 INFO L225 Difference]: With dead ends: 131 [2022-12-14 08:13:42,865 INFO L226 Difference]: Without dead ends: 131 [2022-12-14 08:13:42,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-12-14 08:13:42,865 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 270 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:42,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 76 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:13:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-14 08:13:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 108. [2022-12-14 08:13:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 107 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 08:13:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2022-12-14 08:13:42,867 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 17 [2022-12-14 08:13:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:42,868 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2022-12-14 08:13:42,868 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 08:13:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2022-12-14 08:13:42,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 08:13:42,869 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:42,869 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 08:13:42,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 08:13:42,869 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:42,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:42,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1958547982, now seen corresponding path program 1 times [2022-12-14 08:13:42,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:42,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304190154] [2022-12-14 08:13:42,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:42,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:42,928 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 08:13:42,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:42,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304190154] [2022-12-14 08:13:42,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304190154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:42,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:42,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:13:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416126756] [2022-12-14 08:13:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:42,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:13:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:42,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:13:42,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:13:42,930 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:43,070 INFO L93 Difference]: Finished difference Result 158 states and 186 transitions. [2022-12-14 08:13:43,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 08:13:43,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 08:13:43,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:43,072 INFO L225 Difference]: With dead ends: 158 [2022-12-14 08:13:43,072 INFO L226 Difference]: Without dead ends: 158 [2022-12-14 08:13:43,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:13:43,073 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:43,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 201 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:13:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-12-14 08:13:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 117. [2022-12-14 08:13:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 116 states have internal predecessors, (144), 0 states have call successors, (0), 0 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 08:13:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2022-12-14 08:13:43,077 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 17 [2022-12-14 08:13:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:43,077 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2022-12-14 08:13:43,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:13:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2022-12-14 08:13:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 08:13:43,078 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:43,078 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 08:13:43,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 08:13:43,078 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1320542220, now seen corresponding path program 1 times [2022-12-14 08:13:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:43,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667017849] [2022-12-14 08:13:43,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:43,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:13:43,114 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 08:13:43,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:13:43,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667017849] [2022-12-14 08:13:43,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667017849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:13:43,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:13:43,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:13:43,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082616705] [2022-12-14 08:13:43,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:13:43,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:13:43,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:13:43,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:13:43,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:13:43,115 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 08:13:43,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:13:43,185 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2022-12-14 08:13:43,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:13:43,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 08:13:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:13:43,186 INFO L225 Difference]: With dead ends: 127 [2022-12-14 08:13:43,186 INFO L226 Difference]: Without dead ends: 127 [2022-12-14 08:13:43,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 08:13:43,187 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 106 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:13:43,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 74 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:13:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-12-14 08:13:43,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2022-12-14 08:13:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 116 states have internal predecessors, (142), 0 states have call successors, (0), 0 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 08:13:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2022-12-14 08:13:43,190 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 142 transitions. Word has length 18 [2022-12-14 08:13:43,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:13:43,190 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 142 transitions. [2022-12-14 08:13:43,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 08:13:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions. [2022-12-14 08:13:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 08:13:43,191 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:13:43,191 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 08:13:43,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 08:13:43,192 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-14 08:13:43,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:13:43,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2015326739, now seen corresponding path program 1 times [2022-12-14 08:13:43,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:13:43,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119382388] [2022-12-14 08:13:43,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:13:43,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:13:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 08:13:43,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 08:13:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 08:13:43,235 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 08:13:43,235 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 08:13:43,236 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2022-12-14 08:13:43,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2022-12-14 08:13:43,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2022-12-14 08:13:43,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2022-12-14 08:13:43,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2022-12-14 08:13:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2022-12-14 08:13:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2022-12-14 08:13:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2022-12-14 08:13:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2022-12-14 08:13:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2022-12-14 08:13:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2022-12-14 08:13:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2022-12-14 08:13:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2022-12-14 08:13:43,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2022-12-14 08:13:43,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2022-12-14 08:13:43,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2022-12-14 08:13:43,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2022-12-14 08:13:43,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2022-12-14 08:13:43,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2022-12-14 08:13:43,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2022-12-14 08:13:43,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2022-12-14 08:13:43,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2022-12-14 08:13:43,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2022-12-14 08:13:43,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2022-12-14 08:13:43,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2022-12-14 08:13:43,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2022-12-14 08:13:43,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2022-12-14 08:13:43,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2022-12-14 08:13:43,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2022-12-14 08:13:43,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2022-12-14 08:13:43,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2022-12-14 08:13:43,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2022-12-14 08:13:43,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2022-12-14 08:13:43,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2022-12-14 08:13:43,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2022-12-14 08:13:43,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 61 remaining) [2022-12-14 08:13:43,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 61 remaining) [2022-12-14 08:13:43,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2022-12-14 08:13:43,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2022-12-14 08:13:43,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2022-12-14 08:13:43,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2022-12-14 08:13:43,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2022-12-14 08:13:43,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2022-12-14 08:13:43,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2022-12-14 08:13:43,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2022-12-14 08:13:43,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2022-12-14 08:13:43,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2022-12-14 08:13:43,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2022-12-14 08:13:43,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2022-12-14 08:13:43,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2022-12-14 08:13:43,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2022-12-14 08:13:43,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2022-12-14 08:13:43,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2022-12-14 08:13:43,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2022-12-14 08:13:43,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2022-12-14 08:13:43,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2022-12-14 08:13:43,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2022-12-14 08:13:43,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (3 of 61 remaining) [2022-12-14 08:13:43,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (2 of 61 remaining) [2022-12-14 08:13:43,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (1 of 61 remaining) [2022-12-14 08:13:43,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK (0 of 61 remaining) [2022-12-14 08:13:43,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 08:13:43,249 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:13:43,253 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 08:13:43,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 08:13:43 BoogieIcfgContainer [2022-12-14 08:13:43,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 08:13:43,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 08:13:43,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 08:13:43,271 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 08:13:43,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:13:37" (3/4) ... [2022-12-14 08:13:43,273 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 08:13:43,306 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 08:13:43,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 08:13:43,306 INFO L158 Benchmark]: Toolchain (without parser) took 6251.35ms. Allocated memory is still 146.8MB. Free memory was 111.2MB in the beginning and 86.3MB in the end (delta: 24.8MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2022-12-14 08:13:43,307 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 08:13:43,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.17ms. Allocated memory is still 146.8MB. Free memory was 111.2MB in the beginning and 93.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 08:13:43,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.20ms. Allocated memory is still 146.8MB. Free memory was 93.4MB in the beginning and 91.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 08:13:43,307 INFO L158 Benchmark]: Boogie Preprocessor took 22.26ms. Allocated memory is still 146.8MB. Free memory was 91.2MB in the beginning and 89.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 08:13:43,308 INFO L158 Benchmark]: RCFGBuilder took 511.51ms. Allocated memory is still 146.8MB. Free memory was 89.7MB in the beginning and 60.9MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-14 08:13:43,308 INFO L158 Benchmark]: TraceAbstraction took 5331.54ms. Allocated memory is still 146.8MB. Free memory was 60.3MB in the beginning and 88.4MB in the end (delta: -28.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 08:13:43,308 INFO L158 Benchmark]: Witness Printer took 34.84ms. Allocated memory is still 146.8MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 08:13:43,310 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.12ms. Allocated memory is still 117.4MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.17ms. Allocated memory is still 146.8MB. Free memory was 111.2MB in the beginning and 93.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.20ms. Allocated memory is still 146.8MB. Free memory was 93.4MB in the beginning and 91.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.26ms. Allocated memory is still 146.8MB. Free memory was 91.2MB in the beginning and 89.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 511.51ms. Allocated memory is still 146.8MB. Free memory was 89.7MB in the beginning and 60.9MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5331.54ms. Allocated memory is still 146.8MB. Free memory was 60.3MB in the beginning and 88.4MB in the end (delta: -28.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 34.84ms. Allocated memory is still 146.8MB. Free memory was 88.4MB in the beginning and 86.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: 1063]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1000] SLL* head = malloc(sizeof(SLL)); [L1001] head->next = ((void*)0) VAL [head={-1:0}] [L1002] head->prev = ((void*)0) VAL [head={-1:0}] [L1003] head->data = 0 [L1005] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1019] COND TRUE __VERIFIER_nondet_int() [L1020] x = malloc(sizeof(SLL)) [L1021] x->data = 1 VAL [head={-1:0}, x={-2:0}] [L1022] x->next = head VAL [head={-1:0}, x={-2:0}] [L1023] x->prev = ((void*)0) [L1024] head = x VAL [head={-2:0}, x={-2:0}] [L1050] x = head VAL [head={-2:0}, x={-2:0}] [L1053] EXPR x->data VAL [head={-2:0}, x={-2:0}, x->data=1] [L1053] COND FALSE !(x->data != 1) [L1059] EXPR x->next [L1059] x = x->next [L1060] COND TRUE \read(*x) VAL [head={-2:0}, x={-1:0}] [L1062] EXPR x->data VAL [head={-2:0}, x={-1:0}, x->data=0] [L1062] COND TRUE x->data != 1 [L1063] reach_error() VAL [head={-2:0}, 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 1073]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1073]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1073]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 997]: 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, 109 locations, 61 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1345 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1345 mSDsluCounter, 1723 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1002 mSDsCounter, 221 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2959 IncrementalHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 221 mSolverCounterUnsat, 721 mSDtfsCounter, 2959 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=15, InterpolantAutomatonStates: 103, 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, 16 MinimizatonAttempts, 173 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 1397 SizeOfPredicates, 7 NumberOfNonLiveVariables, 177 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 2/3 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 08:13:43,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ebf79e0-4bdd-44ec-863c-5a66727ec222/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)