./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-optional-2.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_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/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_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-optional-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/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_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/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 88a09c8f9046119952ab983278979c8bac528a0f4e69aababe99c00b4eccdca0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 15:21:38,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:21:38,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:21:38,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:21:38,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:21:38,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:21:38,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:21:38,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:21:38,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:21:38,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:21:38,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:21:38,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:21:38,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:21:38,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:21:38,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:21:38,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:21:38,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:21:38,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:21:38,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:21:38,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:21:38,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:21:38,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:21:38,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:21:38,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:21:38,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:21:38,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:21:38,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:21:38,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:21:38,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:21:38,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:21:38,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:21:38,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:21:38,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:21:38,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:21:38,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:21:38,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:21:38,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:21:38,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:21:38,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:21:38,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:21:38,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:21:38,669 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/bin/utaipan-gh47qXpMRh/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-12-14 15:21:38,685 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:21:38,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:21:38,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:21:38,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:21:38,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:21:38,687 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:21:38,687 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:21:38,687 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:21:38,687 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:21:38,687 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:21:38,687 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:21:38,688 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:21:38,688 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:21:38,688 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:21:38,688 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:21:38,688 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:21:38,688 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:21:38,688 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:21:38,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 15:21:38,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 15:21:38,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:21:38,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:21:38,690 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:21:38,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:21:38,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:21:38,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:21:38,690 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 15:21:38,690 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 15:21:38,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:21:38,691 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:21:38,691 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:21:38,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:21:38,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:21:38,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:21:38,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:21:38,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:21:38,692 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:21:38,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:21:38,692 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:21:38,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:21:38,693 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:21:38,693 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_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/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_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/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 -> 88a09c8f9046119952ab983278979c8bac528a0f4e69aababe99c00b4eccdca0 [2022-12-14 15:21:38,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:21:38,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:21:38,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:21:38,897 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:21:38,897 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:21:38,898 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/forester-heap/sll-optional-2.i [2022-12-14 15:21:41,439 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:21:41,612 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:21:41,612 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/sv-benchmarks/c/forester-heap/sll-optional-2.i [2022-12-14 15:21:41,619 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/bin/utaipan-gh47qXpMRh/data/c538fe0a7/cdf87d441ecb46a381deced3da735f1e/FLAG5ddddb69b [2022-12-14 15:21:41,629 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/bin/utaipan-gh47qXpMRh/data/c538fe0a7/cdf87d441ecb46a381deced3da735f1e [2022-12-14 15:21:41,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:21:41,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:21:41,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:21:41,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:21:41,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:21:41,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:21:41" (1/1) ... [2022-12-14 15:21:41,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ae41b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41, skipping insertion in model container [2022-12-14 15:21:41,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:21:41" (1/1) ... [2022-12-14 15:21:41,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:21:41,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:21:41,833 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_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/sv-benchmarks/c/forester-heap/sll-optional-2.i[22641,22654] [2022-12-14 15:21:41,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:21:41,846 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:21:41,871 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_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/sv-benchmarks/c/forester-heap/sll-optional-2.i[22641,22654] [2022-12-14 15:21:41,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:21:41,889 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:21:41,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41 WrapperNode [2022-12-14 15:21:41,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:21:41,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:21:41,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:21:41,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:21:41,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41" (1/1) ... [2022-12-14 15:21:41,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41" (1/1) ... [2022-12-14 15:21:41,919 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-12-14 15:21:41,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:21:41,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:21:41,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:21:41,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:21:41,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41" (1/1) ... [2022-12-14 15:21:41,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41" (1/1) ... [2022-12-14 15:21:41,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41" (1/1) ... [2022-12-14 15:21:41,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41" (1/1) ... [2022-12-14 15:21:41,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41" (1/1) ... [2022-12-14 15:21:41,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41" (1/1) ... [2022-12-14 15:21:41,939 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41" (1/1) ... [2022-12-14 15:21:41,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41" (1/1) ... [2022-12-14 15:21:41,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:21:41,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:21:41,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:21:41,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:21:41,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41" (1/1) ... [2022-12-14 15:21:41,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:21:41,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:21:41,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:21:41,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:21:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 15:21:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 15:21:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 15:21:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:21:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 15:21:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 15:21:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:21:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 15:21:41,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:21:41,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:21:42,079 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:21:42,081 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:21:42,380 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:21:42,413 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:21:42,413 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-14 15:21:42,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:21:42 BoogieIcfgContainer [2022-12-14 15:21:42,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:21:42,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:21:42,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:21:42,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:21:42,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:21:41" (1/3) ... [2022-12-14 15:21:42,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5216c393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:21:42, skipping insertion in model container [2022-12-14 15:21:42,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:21:41" (2/3) ... [2022-12-14 15:21:42,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5216c393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:21:42, skipping insertion in model container [2022-12-14 15:21:42,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:21:42" (3/3) ... [2022-12-14 15:21:42,421 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-optional-2.i [2022-12-14 15:21:42,436 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:21:42,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2022-12-14 15:21:42,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:21:42,476 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;@21679006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:21:42,476 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2022-12-14 15:21:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 49 states have (on average 2.489795918367347) internal successors, (122), 109 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 15:21:42,484 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:21:42,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 15:21:42,485 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-12-14 15:21:42,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:21:42,489 INFO L85 PathProgramCache]: Analyzing trace with hash 7413, now seen corresponding path program 1 times [2022-12-14 15:21:42,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:21:42,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669116813] [2022-12-14 15:21:42,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:21:42,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:21:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:21:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:21:42,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:21:42,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669116813] [2022-12-14 15:21:42,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669116813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:21:42,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:21:42,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:21:42,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060857034] [2022-12-14 15:21:42,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:21:42,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:21:42,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:21:42,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:21:42,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:21:42,696 INFO L87 Difference]: Start difference. First operand has 110 states, 49 states have (on average 2.489795918367347) internal successors, (122), 109 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 15:21:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:21:42,834 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2022-12-14 15:21:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:21:42,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 15:21:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:21:42,846 INFO L225 Difference]: With dead ends: 110 [2022-12-14 15:21:42,846 INFO L226 Difference]: Without dead ends: 108 [2022-12-14 15:21:42,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:21:42,850 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 95 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:21:42,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 50 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:21:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-12-14 15:21:42,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2022-12-14 15:21:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 52 states have (on average 2.173076923076923) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-12-14 15:21:42,886 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 2 [2022-12-14 15:21:42,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:21:42,886 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-12-14 15:21:42,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-12-14 15:21:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 15:21:42,887 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:21:42,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 15:21:42,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:21:42,888 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-12-14 15:21:42,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:21:42,888 INFO L85 PathProgramCache]: Analyzing trace with hash 7414, now seen corresponding path program 1 times [2022-12-14 15:21:42,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:21:42,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020964972] [2022-12-14 15:21:42,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:21:42,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:21:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:21:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:21:42,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:21:42,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020964972] [2022-12-14 15:21:42,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020964972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:21:42,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:21:42,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:21:42,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332543056] [2022-12-14 15:21:42,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:21:42,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:21:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:21:42,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:21:42,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:21:42,969 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:21:43,060 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2022-12-14 15:21:43,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:21:43,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 15:21:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:21:43,062 INFO L225 Difference]: With dead ends: 98 [2022-12-14 15:21:43,062 INFO L226 Difference]: Without dead ends: 98 [2022-12-14 15:21:43,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:21:43,063 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:21:43,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 65 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:21:43,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-12-14 15:21:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2022-12-14 15:21:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 2.019230769230769) internal successors, (105), 94 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 15:21:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2022-12-14 15:21:43,070 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 2 [2022-12-14 15:21:43,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:21:43,071 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2022-12-14 15:21:43,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2022-12-14 15:21:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:21:43,071 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:21:43,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:21:43,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:21:43,072 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-12-14 15:21:43,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:21:43,072 INFO L85 PathProgramCache]: Analyzing trace with hash -845954935, now seen corresponding path program 1 times [2022-12-14 15:21:43,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:21:43,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705337161] [2022-12-14 15:21:43,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:21:43,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:21:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:21:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:21:43,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:21:43,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705337161] [2022-12-14 15:21:43,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705337161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:21:43,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:21:43,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:21:43,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961308088] [2022-12-14 15:21:43,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:21:43,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:21:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:21:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:21:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:21:43,227 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 5 states, 4 states have (on average 1.75) 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 15:21:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:21:43,370 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2022-12-14 15:21:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:21:43,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) 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 15:21:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:21:43,371 INFO L225 Difference]: With dead ends: 119 [2022-12-14 15:21:43,372 INFO L226 Difference]: Without dead ends: 119 [2022-12-14 15:21:43,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:21:43,373 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 28 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:21:43,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 200 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:21:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-14 15:21:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2022-12-14 15:21:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 52 states have (on average 2.0) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-12-14 15:21:43,379 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 7 [2022-12-14 15:21:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:21:43,380 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-12-14 15:21:43,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) 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 15:21:43,380 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-12-14 15:21:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:21:43,380 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:21:43,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:21:43,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 15:21:43,381 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-12-14 15:21:43,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:21:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash -845954934, now seen corresponding path program 1 times [2022-12-14 15:21:43,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:21:43,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046223465] [2022-12-14 15:21:43,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:21:43,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:21:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:21:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:21:43,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:21:43,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046223465] [2022-12-14 15:21:43,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046223465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:21:43,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:21:43,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:21:43,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347612412] [2022-12-14 15:21:43,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:21:43,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:21:43,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:21:43,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:21:43,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:21:43,551 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 5 states, 4 states have (on average 1.75) 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 15:21:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:21:43,680 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-12-14 15:21:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:21:43,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) 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 15:21:43,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:21:43,681 INFO L225 Difference]: With dead ends: 93 [2022-12-14 15:21:43,681 INFO L226 Difference]: Without dead ends: 93 [2022-12-14 15:21:43,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:21:43,683 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:21:43,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 223 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:21:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-14 15:21:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-12-14 15:21:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 92 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2022-12-14 15:21:43,689 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 7 [2022-12-14 15:21:43,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:21:43,689 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2022-12-14 15:21:43,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) 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 15:21:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-12-14 15:21:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:21:43,690 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:21:43,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:21:43,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 15:21:43,690 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-12-14 15:21:43,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:21:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1318111834, now seen corresponding path program 1 times [2022-12-14 15:21:43,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:21:43,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430412363] [2022-12-14 15:21:43,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:21:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:21:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:21:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:21:43,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:21:43,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430412363] [2022-12-14 15:21:43,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430412363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:21:43,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:21:43,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:21:43,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23771354] [2022-12-14 15:21:43,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:21:43,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:21:43,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:21:43,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:21:43,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:21:43,782 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:21:43,885 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-12-14 15:21:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:21:43,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 15:21:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:21:43,886 INFO L225 Difference]: With dead ends: 94 [2022-12-14 15:21:43,886 INFO L226 Difference]: Without dead ends: 94 [2022-12-14 15:21:43,887 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 15:21:43,888 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 116 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:21:43,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 44 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:21:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-12-14 15:21:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2022-12-14 15:21:43,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 86 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 15:21:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2022-12-14 15:21:43,894 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 10 [2022-12-14 15:21:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:21:43,894 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2022-12-14 15:21:43,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-12-14 15:21:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:21:43,895 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:21:43,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:21:43,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 15:21:43,895 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-12-14 15:21:43,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:21:43,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1318111835, now seen corresponding path program 1 times [2022-12-14 15:21:43,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:21:43,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201068584] [2022-12-14 15:21:43,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:21:43,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:21:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:21:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:21:44,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:21:44,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201068584] [2022-12-14 15:21:44,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201068584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:21:44,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:21:44,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:21:44,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566410801] [2022-12-14 15:21:44,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:21:44,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:21:44,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:21:44,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:21:44,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:21:44,002 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:21:44,136 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2022-12-14 15:21:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:21:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 15:21:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:21:44,137 INFO L225 Difference]: With dead ends: 121 [2022-12-14 15:21:44,138 INFO L226 Difference]: Without dead ends: 121 [2022-12-14 15:21:44,138 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 15:21:44,139 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 205 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:21:44,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 63 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:21:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-14 15:21:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2022-12-14 15:21:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 102 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2022-12-14 15:21:44,145 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 10 [2022-12-14 15:21:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:21:44,145 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2022-12-14 15:21:44,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-12-14 15:21:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 15:21:44,146 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:21:44,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:21:44,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 15:21:44,147 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-12-14 15:21:44,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:21:44,147 INFO L85 PathProgramCache]: Analyzing trace with hash -309722580, now seen corresponding path program 1 times [2022-12-14 15:21:44,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:21:44,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027291015] [2022-12-14 15:21:44,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:21:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:21:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:21:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:21:44,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:21:44,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027291015] [2022-12-14 15:21:44,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027291015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:21:44,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:21:44,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:21:44,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570422789] [2022-12-14 15:21:44,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:21:44,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:21:44,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:21:44,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:21:44,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:21:44,231 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:44,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:21:44,341 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-12-14 15:21:44,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:21:44,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 15:21:44,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:21:44,342 INFO L225 Difference]: With dead ends: 103 [2022-12-14 15:21:44,342 INFO L226 Difference]: Without dead ends: 103 [2022-12-14 15:21:44,342 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 15:21:44,343 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 37 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:21:44,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 141 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:21:44,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-14 15:21:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2022-12-14 15:21:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 101 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2022-12-14 15:21:44,349 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 12 [2022-12-14 15:21:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:21:44,349 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2022-12-14 15:21:44,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2022-12-14 15:21:44,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 15:21:44,350 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:21:44,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:21:44,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 15:21:44,350 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-12-14 15:21:44,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:21:44,351 INFO L85 PathProgramCache]: Analyzing trace with hash -309722579, now seen corresponding path program 1 times [2022-12-14 15:21:44,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:21:44,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24330728] [2022-12-14 15:21:44,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:21:44,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:21:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:21:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:21:44,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:21:44,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24330728] [2022-12-14 15:21:44,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24330728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:21:44,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:21:44,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:21:44,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146612084] [2022-12-14 15:21:44,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:21:44,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:21:44,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:21:44,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:21:44,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:21:44,460 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:21:44,574 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-12-14 15:21:44,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:21:44,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 15:21:44,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:21:44,575 INFO L225 Difference]: With dead ends: 93 [2022-12-14 15:21:44,575 INFO L226 Difference]: Without dead ends: 93 [2022-12-14 15:21:44,575 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 15:21:44,576 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 17 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:21:44,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 161 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:21:44,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-14 15:21:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-12-14 15:21:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.536231884057971) internal successors, (106), 87 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 15:21:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2022-12-14 15:21:44,580 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 12 [2022-12-14 15:21:44,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:21:44,580 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2022-12-14 15:21:44,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2022-12-14 15:21:44,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:21:44,581 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:21:44,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:21:44,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 15:21:44,581 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-12-14 15:21:44,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:21:44,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1016417189, now seen corresponding path program 1 times [2022-12-14 15:21:44,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:21:44,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925165563] [2022-12-14 15:21:44,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:21:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:21:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:21:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:21:44,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:21:44,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925165563] [2022-12-14 15:21:44,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925165563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:21:44,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:21:44,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:21:44,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234650968] [2022-12-14 15:21:44,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:21:44,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:21:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:21:44,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:21:44,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:21:44,618 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:21:44,687 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2022-12-14 15:21:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:21:44,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 15:21:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:21:44,688 INFO L225 Difference]: With dead ends: 106 [2022-12-14 15:21:44,688 INFO L226 Difference]: Without dead ends: 106 [2022-12-14 15:21:44,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:21:44,689 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 85 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:21:44,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 86 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:21:44,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-14 15:21:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-12-14 15:21:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 87 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2022-12-14 15:21:44,693 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 13 [2022-12-14 15:21:44,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:21:44,693 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2022-12-14 15:21:44,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:21:44,694 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2022-12-14 15:21:44,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:21:44,694 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:21:44,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:21:44,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 15:21:44,695 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-12-14 15:21:44,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:21:44,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1916789186, now seen corresponding path program 1 times [2022-12-14 15:21:44,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:21:44,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397542167] [2022-12-14 15:21:44,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:21:44,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:21:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 15:21:44,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 15:21:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 15:21:44,729 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 15:21:44,730 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 15:21:44,730 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (59 of 60 remaining) [2022-12-14 15:21:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 60 remaining) [2022-12-14 15:21:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 60 remaining) [2022-12-14 15:21:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 60 remaining) [2022-12-14 15:21:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 60 remaining) [2022-12-14 15:21:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 60 remaining) [2022-12-14 15:21:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 60 remaining) [2022-12-14 15:21:44,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 60 remaining) [2022-12-14 15:21:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 60 remaining) [2022-12-14 15:21:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 60 remaining) [2022-12-14 15:21:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 60 remaining) [2022-12-14 15:21:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 60 remaining) [2022-12-14 15:21:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 60 remaining) [2022-12-14 15:21:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 60 remaining) [2022-12-14 15:21:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 60 remaining) [2022-12-14 15:21:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 60 remaining) [2022-12-14 15:21:44,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 60 remaining) [2022-12-14 15:21:44,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 60 remaining) [2022-12-14 15:21:44,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 60 remaining) [2022-12-14 15:21:44,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 60 remaining) [2022-12-14 15:21:44,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 60 remaining) [2022-12-14 15:21:44,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 60 remaining) [2022-12-14 15:21:44,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 60 remaining) [2022-12-14 15:21:44,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 60 remaining) [2022-12-14 15:21:44,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 60 remaining) [2022-12-14 15:21:44,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 60 remaining) [2022-12-14 15:21:44,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 60 remaining) [2022-12-14 15:21:44,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 60 remaining) [2022-12-14 15:21:44,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 60 remaining) [2022-12-14 15:21:44,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 60 remaining) [2022-12-14 15:21:44,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 60 remaining) [2022-12-14 15:21:44,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 60 remaining) [2022-12-14 15:21:44,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 60 remaining) [2022-12-14 15:21:44,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 60 remaining) [2022-12-14 15:21:44,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 60 remaining) [2022-12-14 15:21:44,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 60 remaining) [2022-12-14 15:21:44,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 60 remaining) [2022-12-14 15:21:44,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 60 remaining) [2022-12-14 15:21:44,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 60 remaining) [2022-12-14 15:21:44,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 60 remaining) [2022-12-14 15:21:44,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 60 remaining) [2022-12-14 15:21:44,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 60 remaining) [2022-12-14 15:21:44,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 60 remaining) [2022-12-14 15:21:44,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 60 remaining) [2022-12-14 15:21:44,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 60 remaining) [2022-12-14 15:21:44,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 60 remaining) [2022-12-14 15:21:44,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 60 remaining) [2022-12-14 15:21:44,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 60 remaining) [2022-12-14 15:21:44,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 60 remaining) [2022-12-14 15:21:44,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 60 remaining) [2022-12-14 15:21:44,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 60 remaining) [2022-12-14 15:21:44,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 60 remaining) [2022-12-14 15:21:44,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 60 remaining) [2022-12-14 15:21:44,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (6 of 60 remaining) [2022-12-14 15:21:44,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE (5 of 60 remaining) [2022-12-14 15:21:44,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE (4 of 60 remaining) [2022-12-14 15:21:44,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (3 of 60 remaining) [2022-12-14 15:21:44,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (2 of 60 remaining) [2022-12-14 15:21:44,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (1 of 60 remaining) [2022-12-14 15:21:44,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK (0 of 60 remaining) [2022-12-14 15:21:44,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 15:21:44,741 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:21:44,745 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 15:21:44,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:21:44 BoogieIcfgContainer [2022-12-14 15:21:44,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 15:21:44,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 15:21:44,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 15:21:44,762 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 15:21:44,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:21:42" (3/4) ... [2022-12-14 15:21:44,763 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 15:21:44,789 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 15:21:44,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 15:21:44,789 INFO L158 Benchmark]: Toolchain (without parser) took 3158.20ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 99.6MB in the beginning and 60.8MB in the end (delta: 38.8MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2022-12-14 15:21:44,790 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 138.4MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:21:44,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.22ms. Allocated memory is still 138.4MB. Free memory was 99.6MB in the beginning and 82.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 15:21:44,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.88ms. Allocated memory is still 138.4MB. Free memory was 82.4MB in the beginning and 80.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:21:44,790 INFO L158 Benchmark]: Boogie Preprocessor took 21.19ms. Allocated memory is still 138.4MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:21:44,790 INFO L158 Benchmark]: RCFGBuilder took 473.15ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 78.2MB in the beginning and 133.8MB in the end (delta: -55.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-14 15:21:44,791 INFO L158 Benchmark]: TraceAbstraction took 2344.55ms. Allocated memory is still 169.9MB. Free memory was 133.8MB in the beginning and 62.9MB in the end (delta: 70.9MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. [2022-12-14 15:21:44,791 INFO L158 Benchmark]: Witness Printer took 27.49ms. Allocated memory is still 169.9MB. Free memory was 62.9MB in the beginning and 60.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:21:44,792 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 138.4MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.22ms. Allocated memory is still 138.4MB. Free memory was 99.6MB in the beginning and 82.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.88ms. Allocated memory is still 138.4MB. Free memory was 82.4MB in the beginning and 80.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.19ms. Allocated memory is still 138.4MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.15ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 78.2MB in the beginning and 133.8MB in the end (delta: -55.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2344.55ms. Allocated memory is still 169.9MB. Free memory was 133.8MB in the beginning and 62.9MB in the end (delta: 70.9MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. * Witness Printer took 27.49ms. Allocated memory is still 169.9MB. Free memory was 62.9MB in the beginning and 60.8MB 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: 1007]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = ((void*)0) [L998] COND FALSE !(__VERIFIER_nondet_int()) [L998] COND FALSE !(__VERIFIER_nondet_int()) [L998] head->data = 0 VAL [head={-1:0}] [L998] head->opt = head VAL [head={-1:0}] [L999] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1004] x = head VAL [head={-1:0}, x={-1:0}] [L1005] COND TRUE x != ((void*)0) VAL [head={-1:0}, x={-1:0}] [L1007] EXPR x->data [L1007] EXPR x->data == 2 && x->opt == x VAL [head={-1:0}, x={-1:0}, x->data=0, x->data == 2 && x->opt == x=0] [L1007] COND TRUE !(x->data == 2 && x->opt == x) [L1007] reach_error() VAL [head={-1: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: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: 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, 110 locations, 60 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 657 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 657 mSDsluCounter, 1033 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 568 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1131 IncrementalHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 465 mSDtfsCounter, 1131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=0, InterpolantAutomatonStates: 42, 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, 9 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 357 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 15:21:44,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8236ba7-9c2d-4aed-86ce-acf10c98a8c6/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)