./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-optional-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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-5e519f3 [2022-11-03 03:51:38,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:51:38,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:51:38,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:51:38,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:51:38,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:51:38,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:51:38,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:51:38,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:51:38,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:51:38,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:51:38,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:51:38,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:51:38,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:51:38,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:51:38,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:51:38,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:51:38,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:51:38,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:51:38,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:51:38,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:51:38,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:51:38,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:51:38,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:51:38,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:51:38,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:51:38,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:51:38,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:51:38,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:51:38,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:51:38,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:51:38,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:51:38,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:51:38,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:51:38,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:51:38,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:51:38,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:51:38,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:51:38,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:51:38,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:51:38,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:51:38,762 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-11-03 03:51:38,807 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:51:38,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:51:38,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:51:38,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:51:38,809 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:51:38,809 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:51:38,809 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:51:38,809 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:51:38,809 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:51:38,810 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:51:38,811 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:51:38,811 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:51:38,811 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:51:38,811 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:51:38,811 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:51:38,812 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:51:38,812 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:51:38,812 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:51:38,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 03:51:38,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 03:51:38,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:51:38,813 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:51:38,815 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:51:38,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:51:38,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:51:38,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:51:38,816 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 03:51:38,816 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 03:51:38,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:51:38,817 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 03:51:38,817 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:51:38,817 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:51:38,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:51:38,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:51:38,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:51:38,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:51:38,818 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:51:38,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:51:38,818 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:51:38,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:51:38,819 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:51:38,819 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_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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-11-03 03:51:39,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:51:39,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:51:39,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:51:39,183 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:51:39,184 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:51:39,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/forester-heap/sll-optional-2.i [2022-11-03 03:51:39,266 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/data/4a948dbae/ca6fbc691d304f13ba44d9e078fdaf2e/FLAG691d8cb45 [2022-11-03 03:51:39,937 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:51:39,942 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/sv-benchmarks/c/forester-heap/sll-optional-2.i [2022-11-03 03:51:39,963 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/data/4a948dbae/ca6fbc691d304f13ba44d9e078fdaf2e/FLAG691d8cb45 [2022-11-03 03:51:40,185 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/data/4a948dbae/ca6fbc691d304f13ba44d9e078fdaf2e [2022-11-03 03:51:40,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:51:40,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:51:40,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:51:40,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:51:40,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:51:40,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:51:40" (1/1) ... [2022-11-03 03:51:40,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1833ece5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40, skipping insertion in model container [2022-11-03 03:51:40,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:51:40" (1/1) ... [2022-11-03 03:51:40,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:51:40,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:51:40,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/sv-benchmarks/c/forester-heap/sll-optional-2.i[22641,22654] [2022-11-03 03:51:40,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:51:40,712 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:51:40,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/sv-benchmarks/c/forester-heap/sll-optional-2.i[22641,22654] [2022-11-03 03:51:40,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:51:40,786 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:51:40,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40 WrapperNode [2022-11-03 03:51:40,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:51:40,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:51:40,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:51:40,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:51:40,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40" (1/1) ... [2022-11-03 03:51:40,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40" (1/1) ... [2022-11-03 03:51:40,833 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-11-03 03:51:40,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:51:40,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:51:40,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:51:40,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:51:40,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40" (1/1) ... [2022-11-03 03:51:40,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40" (1/1) ... [2022-11-03 03:51:40,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40" (1/1) ... [2022-11-03 03:51:40,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40" (1/1) ... [2022-11-03 03:51:40,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40" (1/1) ... [2022-11-03 03:51:40,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40" (1/1) ... [2022-11-03 03:51:40,879 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40" (1/1) ... [2022-11-03 03:51:40,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40" (1/1) ... [2022-11-03 03:51:40,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:51:40,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:51:40,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:51:40,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:51:40,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40" (1/1) ... [2022-11-03 03:51:40,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:51:40,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:40,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:51:40,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:51:40,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:51:40,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:51:40,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:51:40,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:51:40,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 03:51:40,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 03:51:40,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:51:40,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:51:40,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:51:40,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:51:41,111 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:51:41,113 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:51:41,806 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:51:41,896 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:51:41,897 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-03 03:51:41,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:51:41 BoogieIcfgContainer [2022-11-03 03:51:41,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:51:41,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:51:41,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:51:41,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:51:41,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:51:40" (1/3) ... [2022-11-03 03:51:41,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e04350b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:51:41, skipping insertion in model container [2022-11-03 03:51:41,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:40" (2/3) ... [2022-11-03 03:51:41,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e04350b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:51:41, skipping insertion in model container [2022-11-03 03:51:41,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:51:41" (3/3) ... [2022-11-03 03:51:41,910 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-optional-2.i [2022-11-03 03:51:41,930 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:51:41,931 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2022-11-03 03:51:42,004 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:51:42,016 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;@43e213ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:51:42,017 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2022-11-03 03:51:42,023 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-11-03 03:51:42,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 03:51:42,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:42,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 03:51:42,033 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-11-03 03:51:42,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:42,039 INFO L85 PathProgramCache]: Analyzing trace with hash 7413, now seen corresponding path program 1 times [2022-11-03 03:51:42,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:42,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731998137] [2022-11-03 03:51:42,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:42,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:42,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:42,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731998137] [2022-11-03 03:51:42,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731998137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:42,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:42,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:51:42,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558362716] [2022-11-03 03:51:42,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:42,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:51:42,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:42,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:51:42,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:51:42,407 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-11-03 03:51:42,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:42,633 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2022-11-03 03:51:42,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:51:42,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-03 03:51:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:42,653 INFO L225 Difference]: With dead ends: 110 [2022-11-03 03:51:42,654 INFO L226 Difference]: Without dead ends: 108 [2022-11-03 03:51:42,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:51:42,661 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 95 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:42,662 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.2s Time] [2022-11-03 03:51:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-03 03:51:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2022-11-03 03:51:42,698 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-11-03 03:51:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-11-03 03:51:42,701 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 2 [2022-11-03 03:51:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:42,702 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-11-03 03:51:42,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:42,703 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-11-03 03:51:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 03:51:42,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:42,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 03:51:42,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:51:42,705 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-11-03 03:51:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:42,705 INFO L85 PathProgramCache]: Analyzing trace with hash 7414, now seen corresponding path program 1 times [2022-11-03 03:51:42,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:42,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042559876] [2022-11-03 03:51:42,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:42,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:42,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:42,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042559876] [2022-11-03 03:51:42,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042559876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:42,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:42,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:51:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097997147] [2022-11-03 03:51:42,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:42,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:51:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:42,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:51:42,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:51:42,876 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-11-03 03:51:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:43,022 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2022-11-03 03:51:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:51:43,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-03 03:51:43,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:43,024 INFO L225 Difference]: With dead ends: 98 [2022-11-03 03:51:43,024 INFO L226 Difference]: Without dead ends: 98 [2022-11-03 03:51:43,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:51:43,026 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 11 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-11-03 03:51:43,026 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-11-03 03:51:43,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-03 03:51:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2022-11-03 03:51:43,033 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-11-03 03:51:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2022-11-03 03:51:43,035 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 2 [2022-11-03 03:51:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:43,036 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2022-11-03 03:51:43,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2022-11-03 03:51:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:51:43,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:43,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:43,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:51:43,037 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-11-03 03:51:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:43,038 INFO L85 PathProgramCache]: Analyzing trace with hash -845954935, now seen corresponding path program 1 times [2022-11-03 03:51:43,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:43,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814377379] [2022-11-03 03:51:43,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:43,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:43,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:43,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814377379] [2022-11-03 03:51:43,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814377379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:43,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:43,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:51:43,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360313407] [2022-11-03 03:51:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:43,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:51:43,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:43,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:51:43,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:51:43,315 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-11-03 03:51:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:43,606 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2022-11-03 03:51:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:51:43,608 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-11-03 03:51:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:43,610 INFO L225 Difference]: With dead ends: 119 [2022-11-03 03:51:43,610 INFO L226 Difference]: Without dead ends: 119 [2022-11-03 03:51:43,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:51:43,612 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 28 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:43,613 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.2s Time] [2022-11-03 03:51:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-03 03:51:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2022-11-03 03:51:43,634 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-11-03 03:51:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-11-03 03:51:43,636 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 7 [2022-11-03 03:51:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:43,637 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-11-03 03:51:43,637 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-11-03 03:51:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-11-03 03:51:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:51:43,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:43,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:43,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:51:43,638 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-11-03 03:51:43,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:43,639 INFO L85 PathProgramCache]: Analyzing trace with hash -845954934, now seen corresponding path program 1 times [2022-11-03 03:51:43,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:43,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40045958] [2022-11-03 03:51:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:43,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:43,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:43,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40045958] [2022-11-03 03:51:43,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40045958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:43,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:43,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:51:43,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393072300] [2022-11-03 03:51:43,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:43,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:51:43,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:43,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:51:43,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:51:43,964 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-11-03 03:51:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:44,201 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-11-03 03:51:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:51:44,201 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-11-03 03:51:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:44,204 INFO L225 Difference]: With dead ends: 93 [2022-11-03 03:51:44,205 INFO L226 Difference]: Without dead ends: 93 [2022-11-03 03:51:44,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:51:44,207 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:44,207 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.2s Time] [2022-11-03 03:51:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-03 03:51:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-03 03:51:44,213 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-11-03 03:51:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2022-11-03 03:51:44,214 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 7 [2022-11-03 03:51:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:44,218 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2022-11-03 03:51:44,219 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-11-03 03:51:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-11-03 03:51:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:51:44,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:44,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:44,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:51:44,220 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-11-03 03:51:44,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:44,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1318111834, now seen corresponding path program 1 times [2022-11-03 03:51:44,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:44,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241389815] [2022-11-03 03:51:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:44,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:44,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241389815] [2022-11-03 03:51:44,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241389815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:44,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:44,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:51:44,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939615144] [2022-11-03 03:51:44,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:44,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:51:44,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:44,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:51:44,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:51:44,387 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-11-03 03:51:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:44,557 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-11-03 03:51:44,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:51:44,558 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-11-03 03:51:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:44,559 INFO L225 Difference]: With dead ends: 94 [2022-11-03 03:51:44,559 INFO L226 Difference]: Without dead ends: 94 [2022-11-03 03:51:44,559 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-11-03 03:51:44,561 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 110 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:44,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 44 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:51:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-03 03:51:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2022-11-03 03:51:44,567 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-11-03 03:51:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2022-11-03 03:51:44,568 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 10 [2022-11-03 03:51:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:44,568 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2022-11-03 03:51:44,568 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-11-03 03:51:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-11-03 03:51:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:51:44,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:44,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:44,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:51:44,570 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-11-03 03:51:44,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:44,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1318111835, now seen corresponding path program 1 times [2022-11-03 03:51:44,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:44,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047371192] [2022-11-03 03:51:44,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:44,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:44,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:44,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047371192] [2022-11-03 03:51:44,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047371192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:44,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:44,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:51:44,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277178252] [2022-11-03 03:51:44,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:44,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:51:44,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:44,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:51:44,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:51:44,721 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-11-03 03:51:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:44,932 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2022-11-03 03:51:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:51:44,933 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-11-03 03:51:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:44,934 INFO L225 Difference]: With dead ends: 121 [2022-11-03 03:51:44,934 INFO L226 Difference]: Without dead ends: 121 [2022-11-03 03:51:44,934 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-11-03 03:51:44,936 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 197 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:44,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 63 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:51:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-03 03:51:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2022-11-03 03:51:44,942 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-11-03 03:51:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2022-11-03 03:51:44,943 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 10 [2022-11-03 03:51:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:44,943 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2022-11-03 03:51:44,944 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-11-03 03:51:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-11-03 03:51:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:51:44,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:44,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:44,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:51:44,945 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-11-03 03:51:44,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:44,946 INFO L85 PathProgramCache]: Analyzing trace with hash -309722580, now seen corresponding path program 1 times [2022-11-03 03:51:44,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:44,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532580173] [2022-11-03 03:51:44,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:44,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:45,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:45,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532580173] [2022-11-03 03:51:45,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532580173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:45,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:45,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:51:45,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495282392] [2022-11-03 03:51:45,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:45,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:51:45,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:45,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:51:45,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:51:45,103 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-11-03 03:51:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:45,274 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-11-03 03:51:45,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:51:45,275 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-11-03 03:51:45,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:45,276 INFO L225 Difference]: With dead ends: 103 [2022-11-03 03:51:45,277 INFO L226 Difference]: Without dead ends: 103 [2022-11-03 03:51:45,278 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-11-03 03:51:45,280 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 37 mSDsluCounter, 89 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.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:45,283 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.2s Time] [2022-11-03 03:51:45,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-03 03:51:45,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2022-11-03 03:51:45,300 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-11-03 03:51:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2022-11-03 03:51:45,301 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 12 [2022-11-03 03:51:45,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:45,303 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2022-11-03 03:51:45,304 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-11-03 03:51:45,304 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2022-11-03 03:51:45,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:51:45,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:45,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:45,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:51:45,309 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-11-03 03:51:45,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash -309722579, now seen corresponding path program 1 times [2022-11-03 03:51:45,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:45,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511756294] [2022-11-03 03:51:45,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:45,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:45,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:45,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511756294] [2022-11-03 03:51:45,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511756294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:45,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:45,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:51:45,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84739458] [2022-11-03 03:51:45,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:45,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:51:45,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:45,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:51:45,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:51:45,540 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-11-03 03:51:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:45,719 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-11-03 03:51:45,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:51:45,720 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-11-03 03:51:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:45,720 INFO L225 Difference]: With dead ends: 93 [2022-11-03 03:51:45,721 INFO L226 Difference]: Without dead ends: 93 [2022-11-03 03:51:45,721 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-11-03 03:51:45,722 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:45,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 161 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:51:45,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-03 03:51:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-11-03 03:51:45,726 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-11-03 03:51:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2022-11-03 03:51:45,727 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 12 [2022-11-03 03:51:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:45,727 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2022-11-03 03:51:45,727 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-11-03 03:51:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2022-11-03 03:51:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:51:45,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:45,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:45,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:51:45,729 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-11-03 03:51:45,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:45,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1016417189, now seen corresponding path program 1 times [2022-11-03 03:51:45,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:45,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420655650] [2022-11-03 03:51:45,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:45,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:45,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:45,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420655650] [2022-11-03 03:51:45,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420655650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:45,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:45,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:51:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786768744] [2022-11-03 03:51:45,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:45,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:51:45,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:45,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:51:45,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:51:45,792 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-11-03 03:51:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:45,899 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2022-11-03 03:51:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:51:45,900 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-11-03 03:51:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:45,901 INFO L225 Difference]: With dead ends: 106 [2022-11-03 03:51:45,901 INFO L226 Difference]: Without dead ends: 106 [2022-11-03 03:51:45,901 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-11-03 03:51:45,904 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 83 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:45,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 86 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:51:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-03 03:51:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-11-03 03:51:45,916 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-11-03 03:51:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2022-11-03 03:51:45,918 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 13 [2022-11-03 03:51:45,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:45,918 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2022-11-03 03:51:45,919 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-11-03 03:51:45,919 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2022-11-03 03:51:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:51:45,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:45,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:45,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 03:51:45,921 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-11-03 03:51:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:45,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1916789186, now seen corresponding path program 1 times [2022-11-03 03:51:45,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:45,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566915576] [2022-11-03 03:51:45,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:45,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:51:45,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:51:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:51:45,998 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:51:45,999 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:51:46,000 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (59 of 60 remaining) [2022-11-03 03:51:46,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 60 remaining) [2022-11-03 03:51:46,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 60 remaining) [2022-11-03 03:51:46,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 60 remaining) [2022-11-03 03:51:46,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 60 remaining) [2022-11-03 03:51:46,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 60 remaining) [2022-11-03 03:51:46,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 60 remaining) [2022-11-03 03:51:46,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 60 remaining) [2022-11-03 03:51:46,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 60 remaining) [2022-11-03 03:51:46,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 60 remaining) [2022-11-03 03:51:46,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 60 remaining) [2022-11-03 03:51:46,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 60 remaining) [2022-11-03 03:51:46,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 60 remaining) [2022-11-03 03:51:46,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 60 remaining) [2022-11-03 03:51:46,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 60 remaining) [2022-11-03 03:51:46,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 60 remaining) [2022-11-03 03:51:46,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 60 remaining) [2022-11-03 03:51:46,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 60 remaining) [2022-11-03 03:51:46,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 60 remaining) [2022-11-03 03:51:46,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 60 remaining) [2022-11-03 03:51:46,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 60 remaining) [2022-11-03 03:51:46,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 60 remaining) [2022-11-03 03:51:46,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 60 remaining) [2022-11-03 03:51:46,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 60 remaining) [2022-11-03 03:51:46,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 60 remaining) [2022-11-03 03:51:46,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 60 remaining) [2022-11-03 03:51:46,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 60 remaining) [2022-11-03 03:51:46,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 60 remaining) [2022-11-03 03:51:46,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 60 remaining) [2022-11-03 03:51:46,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 60 remaining) [2022-11-03 03:51:46,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 60 remaining) [2022-11-03 03:51:46,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 60 remaining) [2022-11-03 03:51:46,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 60 remaining) [2022-11-03 03:51:46,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 60 remaining) [2022-11-03 03:51:46,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 60 remaining) [2022-11-03 03:51:46,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 60 remaining) [2022-11-03 03:51:46,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 60 remaining) [2022-11-03 03:51:46,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 60 remaining) [2022-11-03 03:51:46,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 60 remaining) [2022-11-03 03:51:46,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 60 remaining) [2022-11-03 03:51:46,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 60 remaining) [2022-11-03 03:51:46,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 60 remaining) [2022-11-03 03:51:46,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 60 remaining) [2022-11-03 03:51:46,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 60 remaining) [2022-11-03 03:51:46,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 60 remaining) [2022-11-03 03:51:46,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 60 remaining) [2022-11-03 03:51:46,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 60 remaining) [2022-11-03 03:51:46,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 60 remaining) [2022-11-03 03:51:46,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 60 remaining) [2022-11-03 03:51:46,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 60 remaining) [2022-11-03 03:51:46,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 60 remaining) [2022-11-03 03:51:46,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 60 remaining) [2022-11-03 03:51:46,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 60 remaining) [2022-11-03 03:51:46,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (6 of 60 remaining) [2022-11-03 03:51:46,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE (5 of 60 remaining) [2022-11-03 03:51:46,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE (4 of 60 remaining) [2022-11-03 03:51:46,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (3 of 60 remaining) [2022-11-03 03:51:46,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (2 of 60 remaining) [2022-11-03 03:51:46,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (1 of 60 remaining) [2022-11-03 03:51:46,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK (0 of 60 remaining) [2022-11-03 03:51:46,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 03:51:46,031 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:46,036 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:51:46,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:51:46 BoogieIcfgContainer [2022-11-03 03:51:46,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:51:46,076 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:51:46,076 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:51:46,077 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:51:46,077 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:51:41" (3/4) ... [2022-11-03 03:51:46,079 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 03:51:46,132 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 03:51:46,133 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:51:46,133 INFO L158 Benchmark]: Toolchain (without parser) took 5943.61ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 75.6MB in the beginning and 130.8MB in the end (delta: -55.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:51:46,134 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 115.3MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:51:46,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.65ms. Allocated memory is still 115.3MB. Free memory was 75.4MB in the beginning and 82.9MB in the end (delta: -7.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 03:51:46,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.66ms. Allocated memory is still 115.3MB. Free memory was 82.9MB in the beginning and 80.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:51:46,135 INFO L158 Benchmark]: Boogie Preprocessor took 46.07ms. Allocated memory is still 115.3MB. Free memory was 80.8MB in the beginning and 78.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 03:51:46,136 INFO L158 Benchmark]: RCFGBuilder took 1015.95ms. Allocated memory is still 115.3MB. Free memory was 78.7MB in the beginning and 50.9MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-03 03:51:46,136 INFO L158 Benchmark]: TraceAbstraction took 4172.99ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 50.4MB in the beginning and 132.9MB in the end (delta: -82.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:51:46,138 INFO L158 Benchmark]: Witness Printer took 56.60ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 130.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:51:46,140 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.34ms. Allocated memory is still 115.3MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.65ms. Allocated memory is still 115.3MB. Free memory was 75.4MB in the beginning and 82.9MB in the end (delta: -7.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.66ms. Allocated memory is still 115.3MB. Free memory was 82.9MB in the beginning and 80.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.07ms. Allocated memory is still 115.3MB. Free memory was 80.8MB in the beginning and 78.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1015.95ms. Allocated memory is still 115.3MB. Free memory was 78.7MB in the beginning and 50.9MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4172.99ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 50.4MB in the beginning and 132.9MB in the end (delta: -82.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 56.60ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 130.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: 4.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 640 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 640 mSDsluCounter, 1033 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 589 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1131 IncrementalHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 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.2s 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, 1.4s 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-11-03 03:51:46,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16756db8-f9fe-4273-9c64-cbd946b8bdd3/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)