./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8393723b 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_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS --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 f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e --- 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-8393723 [2022-11-19 07:03:05,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:03:05,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:03:05,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:03:05,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:03:05,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:03:05,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:03:05,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:03:05,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:03:05,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:03:05,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:03:05,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:03:05,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:03:05,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:03:05,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:03:05,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:03:05,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:03:05,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:03:05,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:03:05,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:03:05,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:03:05,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:03:05,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:03:05,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:03:05,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:03:05,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:03:05,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:03:05,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:03:05,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:03:05,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:03:05,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:03:05,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:03:05,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:03:05,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:03:05,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:03:05,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:03:05,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:03:05,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:03:05,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:03:05,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:03:05,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:03:05,856 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-11-19 07:03:05,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:03:05,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:03:05,898 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:03:05,898 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:03:05,899 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:03:05,899 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:03:05,899 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:03:05,900 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:03:05,900 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:03:05,900 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:03:05,901 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:03:05,901 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:03:05,901 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:03:05,902 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:03:05,902 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:03:05,902 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:03:05,902 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:03:05,903 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:03:05,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:03:05,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:03:05,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:03:05,905 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:03:05,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:03:05,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:03:05,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:03:05,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:03:05,906 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:03:05,907 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:03:05,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:03:05,907 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:03:05,907 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:03:05,908 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:03:05,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:03:05,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:03:05,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:03:05,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:03:05,909 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:03:05,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:03:05,909 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:03:05,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:03:05,911 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:03:05,911 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_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/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_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS 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 -> f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e [2022-11-19 07:03:06,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:03:06,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:03:06,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:03:06,261 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:03:06,268 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:03:06,270 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/forester-heap/sll-circular-2.i [2022-11-19 07:03:06,351 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/data/9e3539bc7/46f2e94c0cf44b6c94cd02cbc3edf793/FLAGc4901e0b3 [2022-11-19 07:03:06,964 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:03:06,965 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/sv-benchmarks/c/forester-heap/sll-circular-2.i [2022-11-19 07:03:06,976 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/data/9e3539bc7/46f2e94c0cf44b6c94cd02cbc3edf793/FLAGc4901e0b3 [2022-11-19 07:03:07,264 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/data/9e3539bc7/46f2e94c0cf44b6c94cd02cbc3edf793 [2022-11-19 07:03:07,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:03:07,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:03:07,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:03:07,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:03:07,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:03:07,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:03:07" (1/1) ... [2022-11-19 07:03:07,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a9a844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07, skipping insertion in model container [2022-11-19 07:03:07,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:03:07" (1/1) ... [2022-11-19 07:03:07,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:03:07,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:03:07,625 WARN L234 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_2d34907d-c089-4f85-81cb-e9654a4951a3/sv-benchmarks/c/forester-heap/sll-circular-2.i[22324,22337] [2022-11-19 07:03:07,631 WARN L234 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_2d34907d-c089-4f85-81cb-e9654a4951a3/sv-benchmarks/c/forester-heap/sll-circular-2.i[22430,22443] [2022-11-19 07:03:07,633 WARN L234 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_2d34907d-c089-4f85-81cb-e9654a4951a3/sv-benchmarks/c/forester-heap/sll-circular-2.i[22554,22567] [2022-11-19 07:03:07,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:03:07,646 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:03:07,682 WARN L234 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_2d34907d-c089-4f85-81cb-e9654a4951a3/sv-benchmarks/c/forester-heap/sll-circular-2.i[22324,22337] [2022-11-19 07:03:07,683 WARN L234 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_2d34907d-c089-4f85-81cb-e9654a4951a3/sv-benchmarks/c/forester-heap/sll-circular-2.i[22430,22443] [2022-11-19 07:03:07,685 WARN L234 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_2d34907d-c089-4f85-81cb-e9654a4951a3/sv-benchmarks/c/forester-heap/sll-circular-2.i[22554,22567] [2022-11-19 07:03:07,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:03:07,714 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:03:07,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07 WrapperNode [2022-11-19 07:03:07,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:03:07,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:03:07,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:03:07,718 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:03:07,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07" (1/1) ... [2022-11-19 07:03:07,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07" (1/1) ... [2022-11-19 07:03:07,760 INFO L138 Inliner]: procedures = 119, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 119 [2022-11-19 07:03:07,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:03:07,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:03:07,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:03:07,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:03:07,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07" (1/1) ... [2022-11-19 07:03:07,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07" (1/1) ... [2022-11-19 07:03:07,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07" (1/1) ... [2022-11-19 07:03:07,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07" (1/1) ... [2022-11-19 07:03:07,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07" (1/1) ... [2022-11-19 07:03:07,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07" (1/1) ... [2022-11-19 07:03:07,788 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07" (1/1) ... [2022-11-19 07:03:07,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07" (1/1) ... [2022-11-19 07:03:07,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:03:07,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:03:07,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:03:07,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:03:07,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07" (1/1) ... [2022-11-19 07:03:07,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:03:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:03:07,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:03:07,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:03:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 07:03:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:03:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 07:03:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:03:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 07:03:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 07:03:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:03:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:03:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:03:07,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:03:08,065 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:03:08,067 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:03:08,500 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:03:08,562 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:03:08,562 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-19 07:03:08,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:03:08 BoogieIcfgContainer [2022-11-19 07:03:08,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:03:08,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:03:08,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:03:08,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:03:08,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:03:07" (1/3) ... [2022-11-19 07:03:08,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5cfad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:03:08, skipping insertion in model container [2022-11-19 07:03:08,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:07" (2/3) ... [2022-11-19 07:03:08,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5cfad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:03:08, skipping insertion in model container [2022-11-19 07:03:08,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:03:08" (3/3) ... [2022-11-19 07:03:08,582 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2022-11-19 07:03:08,604 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:03:08,606 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-11-19 07:03:08,684 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:03:08,694 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;@71c1bc0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:03:08,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-19 07:03:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 43 states have (on average 2.511627906976744) internal successors, (108), 89 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:03:08,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:08,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:03:08,717 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:08,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:08,726 INFO L85 PathProgramCache]: Analyzing trace with hash 7320, now seen corresponding path program 1 times [2022-11-19 07:03:08,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:08,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432055986] [2022-11-19 07:03:08,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:08,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:03:08,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:09,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432055986] [2022-11-19 07:03:09,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432055986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:09,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:09,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:03:09,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400798365] [2022-11-19 07:03:09,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:09,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:03:09,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:09,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:03:09,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:03:09,056 INFO L87 Difference]: Start difference. First operand has 90 states, 43 states have (on average 2.511627906976744) internal successors, (108), 89 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-19 07:03:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:09,277 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-11-19 07:03:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:03:09,280 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-19 07:03:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:09,289 INFO L225 Difference]: With dead ends: 96 [2022-11-19 07:03:09,290 INFO L226 Difference]: Without dead ends: 95 [2022-11-19 07:03:09,292 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-19 07:03:09,305 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 77 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:09,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 61 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:03:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-19 07:03:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2022-11-19 07:03:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 43 states have (on average 2.116279069767442) internal successors, (91), 84 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-11-19 07:03:09,359 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 2 [2022-11-19 07:03:09,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:09,360 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-11-19 07:03:09,360 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-19 07:03:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-11-19 07:03:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:03:09,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:09,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:03:09,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:03:09,364 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:09,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash 7321, now seen corresponding path program 1 times [2022-11-19 07:03:09,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:09,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726729704] [2022-11-19 07:03:09,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:09,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:09,502 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-19 07:03:09,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:09,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726729704] [2022-11-19 07:03:09,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726729704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:09,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:09,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:03:09,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102062156] [2022-11-19 07:03:09,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:09,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:03:09,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:09,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:03:09,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:03:09,507 INFO L87 Difference]: Start difference. First operand 85 states and 91 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-19 07:03:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:09,592 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-11-19 07:03:09,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:03:09,592 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-19 07:03:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:09,594 INFO L225 Difference]: With dead ends: 93 [2022-11-19 07:03:09,594 INFO L226 Difference]: Without dead ends: 93 [2022-11-19 07:03:09,594 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-19 07:03:09,595 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:09,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 64 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:03:09,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-19 07:03:09,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-11-19 07:03:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-11-19 07:03:09,603 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 2 [2022-11-19 07:03:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:09,604 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-11-19 07:03:09,604 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-19 07:03:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-11-19 07:03:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 07:03:09,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:09,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 07:03:09,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:03:09,606 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1824801511, now seen corresponding path program 1 times [2022-11-19 07:03:09,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:09,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485644489] [2022-11-19 07:03:09,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:09,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:09,701 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-19 07:03:09,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:09,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485644489] [2022-11-19 07:03:09,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485644489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:09,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:09,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:03:09,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576809299] [2022-11-19 07:03:09,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:09,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:03:09,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:09,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:03:09,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:03:09,705 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:09,856 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-11-19 07:03:09,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:03:09,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-19 07:03:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:09,857 INFO L225 Difference]: With dead ends: 79 [2022-11-19 07:03:09,858 INFO L226 Difference]: Without dead ends: 79 [2022-11-19 07:03:09,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:03:09,860 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 120 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:09,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 41 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:03:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-19 07:03:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-11-19 07:03:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 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-19 07:03:09,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-11-19 07:03:09,867 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 6 [2022-11-19 07:03:09,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:09,868 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-11-19 07:03:09,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:09,868 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-11-19 07:03:09,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 07:03:09,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:09,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 07:03:09,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:03:09,870 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1824801510, now seen corresponding path program 1 times [2022-11-19 07:03:09,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:09,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652017325] [2022-11-19 07:03:09,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:10,012 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-19 07:03:10,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:10,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652017325] [2022-11-19 07:03:10,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652017325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:10,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:10,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:03:10,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622075707] [2022-11-19 07:03:10,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:10,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:03:10,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:10,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:03:10,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:03:10,015 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:10,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:10,190 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2022-11-19 07:03:10,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:03:10,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-19 07:03:10,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:10,192 INFO L225 Difference]: With dead ends: 87 [2022-11-19 07:03:10,192 INFO L226 Difference]: Without dead ends: 87 [2022-11-19 07:03:10,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:03:10,194 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 73 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:10,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 80 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:03:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-19 07:03:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2022-11-19 07:03:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 74 states have internal predecessors, (82), 0 states have call successors, (0), 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-19 07:03:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-11-19 07:03:10,200 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 6 [2022-11-19 07:03:10,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:10,200 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-11-19 07:03:10,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-11-19 07:03:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-19 07:03:10,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:10,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:10,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:03:10,202 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:10,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:10,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1287407321, now seen corresponding path program 1 times [2022-11-19 07:03:10,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:10,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338187117] [2022-11-19 07:03:10,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:10,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:10,372 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-19 07:03:10,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:10,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338187117] [2022-11-19 07:03:10,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338187117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:10,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:10,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:03:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88346701] [2022-11-19 07:03:10,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:10,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:03:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:10,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:03:10,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:03:10,376 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:10,546 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-11-19 07:03:10,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:03:10,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-19 07:03:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:10,551 INFO L225 Difference]: With dead ends: 74 [2022-11-19 07:03:10,552 INFO L226 Difference]: Without dead ends: 74 [2022-11-19 07:03:10,554 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-19 07:03:10,556 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 51 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:10,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 106 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:03:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-19 07:03:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-19 07:03:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.6875) internal successors, (81), 73 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-11-19 07:03:10,561 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 8 [2022-11-19 07:03:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:10,561 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-11-19 07:03:10,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-11-19 07:03:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-19 07:03:10,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:10,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:10,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:03:10,563 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:10,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:10,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1287407320, now seen corresponding path program 1 times [2022-11-19 07:03:10,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:10,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30550393] [2022-11-19 07:03:10,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:10,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:10,831 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-19 07:03:10,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:10,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30550393] [2022-11-19 07:03:10,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30550393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:10,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:10,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:03:10,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139828339] [2022-11-19 07:03:10,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:10,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:03:10,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:10,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:03:10,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:03:10,835 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:11,066 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-11-19 07:03:11,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:03:11,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-19 07:03:11,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:11,067 INFO L225 Difference]: With dead ends: 70 [2022-11-19 07:03:11,067 INFO L226 Difference]: Without dead ends: 70 [2022-11-19 07:03:11,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:03:11,072 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:11,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 151 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:03:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-19 07:03:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-11-19 07:03:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.627906976744186) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 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-19 07:03:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-19 07:03:11,091 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 8 [2022-11-19 07:03:11,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:11,091 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-19 07:03:11,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-19 07:03:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 07:03:11,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:11,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:11,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:03:11,093 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:11,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:11,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1260581677, now seen corresponding path program 1 times [2022-11-19 07:03:11,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:11,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074896402] [2022-11-19 07:03:11,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:11,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:11,456 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-19 07:03:11,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:11,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074896402] [2022-11-19 07:03:11,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074896402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:11,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:11,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:03:11,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129867528] [2022-11-19 07:03:11,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:11,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:03:11,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:11,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:03:11,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:03:11,460 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:11,709 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-11-19 07:03:11,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:03:11,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-19 07:03:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:11,711 INFO L225 Difference]: With dead ends: 144 [2022-11-19 07:03:11,712 INFO L226 Difference]: Without dead ends: 144 [2022-11-19 07:03:11,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:03:11,714 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 174 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:11,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 227 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:03:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-19 07:03:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 69. [2022-11-19 07:03:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 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-19 07:03:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-11-19 07:03:11,726 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 9 [2022-11-19 07:03:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:11,726 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-11-19 07:03:11,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-11-19 07:03:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:03:11,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:11,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:11,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:03:11,728 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:11,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash -423322160, now seen corresponding path program 1 times [2022-11-19 07:03:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:11,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484134940] [2022-11-19 07:03:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:11,919 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-19 07:03:11,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:11,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484134940] [2022-11-19 07:03:11,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484134940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:11,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:11,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:03:11,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388817807] [2022-11-19 07:03:11,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:11,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:03:11,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:11,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:03:11,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:03:11,922 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:12,106 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-11-19 07:03:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:03:12,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 07:03:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:12,108 INFO L225 Difference]: With dead ends: 105 [2022-11-19 07:03:12,108 INFO L226 Difference]: Without dead ends: 105 [2022-11-19 07:03:12,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:03:12,109 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 263 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:12,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 81 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:03:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-19 07:03:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2022-11-19 07:03:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 83 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-19 07:03:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2022-11-19 07:03:12,114 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 10 [2022-11-19 07:03:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:12,114 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2022-11-19 07:03:12,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2022-11-19 07:03:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:03:12,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:12,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:12,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:03:12,116 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash -423322159, now seen corresponding path program 1 times [2022-11-19 07:03:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:12,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662068670] [2022-11-19 07:03:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:12,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:12,398 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-19 07:03:12,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:12,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662068670] [2022-11-19 07:03:12,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662068670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:12,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:12,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:03:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941111863] [2022-11-19 07:03:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:12,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:03:12,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:12,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:03:12,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:03:12,401 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:12,617 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-11-19 07:03:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:03:12,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 07:03:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:12,619 INFO L225 Difference]: With dead ends: 118 [2022-11-19 07:03:12,619 INFO L226 Difference]: Without dead ends: 118 [2022-11-19 07:03:12,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:03:12,619 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 248 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:12,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 103 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:03:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-19 07:03:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2022-11-19 07:03:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 90 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2022-11-19 07:03:12,624 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 10 [2022-11-19 07:03:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:12,625 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2022-11-19 07:03:12,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2022-11-19 07:03:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:03:12,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:12,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:12,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:03:12,626 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:12,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:12,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1806268972, now seen corresponding path program 1 times [2022-11-19 07:03:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:12,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9705479] [2022-11-19 07:03:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:12,715 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-19 07:03:12,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:12,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9705479] [2022-11-19 07:03:12,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9705479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:12,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:12,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:03:12,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69677864] [2022-11-19 07:03:12,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:12,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:03:12,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:12,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:03:12,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:03:12,718 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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-19 07:03:12,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:12,825 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2022-11-19 07:03:12,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:03:12,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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-19 07:03:12,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:12,827 INFO L225 Difference]: With dead ends: 91 [2022-11-19 07:03:12,827 INFO L226 Difference]: Without dead ends: 91 [2022-11-19 07:03:12,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 07:03:12,828 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:12,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 175 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:03:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-19 07:03:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-11-19 07:03:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 88 states have internal predecessors, (107), 0 states have call successors, (0), 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-19 07:03:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2022-11-19 07:03:12,832 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 12 [2022-11-19 07:03:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:12,832 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2022-11-19 07:03:12,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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-19 07:03:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2022-11-19 07:03:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:03:12,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:12,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:12,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:03:12,834 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:12,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:12,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1166409919, now seen corresponding path program 1 times [2022-11-19 07:03:12,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:12,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208447042] [2022-11-19 07:03:12,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:12,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:13,140 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-19 07:03:13,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:13,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208447042] [2022-11-19 07:03:13,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208447042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:13,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:13,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:03:13,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73141046] [2022-11-19 07:03:13,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:13,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:03:13,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:13,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:03:13,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:03:13,145 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:13,426 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2022-11-19 07:03:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:03:13,428 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 07:03:13,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:13,429 INFO L225 Difference]: With dead ends: 119 [2022-11-19 07:03:13,429 INFO L226 Difference]: Without dead ends: 119 [2022-11-19 07:03:13,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:03:13,430 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 178 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:13,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 188 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:03:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-19 07:03:13,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2022-11-19 07:03:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.5555555555555556) internal successors, (112), 91 states have internal predecessors, (112), 0 states have call successors, (0), 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-19 07:03:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2022-11-19 07:03:13,433 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 13 [2022-11-19 07:03:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:13,433 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2022-11-19 07:03:13,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2022-11-19 07:03:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:03:13,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:13,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:13,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:03:13,434 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:13,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1166409918, now seen corresponding path program 1 times [2022-11-19 07:03:13,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:13,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727860501] [2022-11-19 07:03:13,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:13,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:13,869 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-19 07:03:13,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:13,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727860501] [2022-11-19 07:03:13,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727860501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:13,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:13,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:03:13,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309852622] [2022-11-19 07:03:13,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:13,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:03:13,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:13,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:03:13,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:03:13,878 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:14,171 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2022-11-19 07:03:14,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:03:14,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 07:03:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:14,172 INFO L225 Difference]: With dead ends: 131 [2022-11-19 07:03:14,172 INFO L226 Difference]: Without dead ends: 131 [2022-11-19 07:03:14,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:03:14,173 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 148 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:14,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 183 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:03:14,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-19 07:03:14,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 92. [2022-11-19 07:03:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 91 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2022-11-19 07:03:14,177 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 13 [2022-11-19 07:03:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:14,177 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2022-11-19 07:03:14,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2022-11-19 07:03:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:03:14,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:14,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:14,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:03:14,178 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:14,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2136007192, now seen corresponding path program 1 times [2022-11-19 07:03:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:14,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940166906] [2022-11-19 07:03:14,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:14,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:14,211 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-19 07:03:14,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:14,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940166906] [2022-11-19 07:03:14,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940166906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:14,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:14,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:03:14,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052155885] [2022-11-19 07:03:14,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:14,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:03:14,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:14,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:03:14,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:03:14,214 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:14,260 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2022-11-19 07:03:14,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:03:14,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 07:03:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:14,263 INFO L225 Difference]: With dead ends: 150 [2022-11-19 07:03:14,263 INFO L226 Difference]: Without dead ends: 150 [2022-11-19 07:03:14,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:03:14,264 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:14,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 105 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:03:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-19 07:03:14,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 102. [2022-11-19 07:03:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.5) internal successors, (123), 101 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2022-11-19 07:03:14,268 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 15 [2022-11-19 07:03:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:14,269 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2022-11-19 07:03:14,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2022-11-19 07:03:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:03:14,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:14,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:14,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 07:03:14,271 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2084441583, now seen corresponding path program 1 times [2022-11-19 07:03:14,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:14,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822119342] [2022-11-19 07:03:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:14,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:14,463 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-19 07:03:14,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:14,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822119342] [2022-11-19 07:03:14,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822119342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:14,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:14,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:03:14,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392537286] [2022-11-19 07:03:14,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:14,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:03:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:14,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:03:14,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:03:14,466 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:14,644 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-11-19 07:03:14,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:03:14,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 07:03:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:14,645 INFO L225 Difference]: With dead ends: 141 [2022-11-19 07:03:14,645 INFO L226 Difference]: Without dead ends: 141 [2022-11-19 07:03:14,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:03:14,646 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 238 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:14,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 145 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:03:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-19 07:03:14,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2022-11-19 07:03:14,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 104 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2022-11-19 07:03:14,649 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 16 [2022-11-19 07:03:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:14,650 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2022-11-19 07:03:14,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2022-11-19 07:03:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:03:14,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:14,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:14,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:03:14,651 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:14,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:14,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2065219022, now seen corresponding path program 1 times [2022-11-19 07:03:14,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:14,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531368240] [2022-11-19 07:03:14,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:14,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:03:15,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:15,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531368240] [2022-11-19 07:03:15,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531368240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:15,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:15,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-19 07:03:15,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525372455] [2022-11-19 07:03:15,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:15,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 07:03:15,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:15,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 07:03:15,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:03:15,149 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:15,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:15,633 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-11-19 07:03:15,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 07:03:15,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 07:03:15,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:15,634 INFO L225 Difference]: With dead ends: 120 [2022-11-19 07:03:15,634 INFO L226 Difference]: Without dead ends: 120 [2022-11-19 07:03:15,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:03:15,635 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 152 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:15,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 252 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:03:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-19 07:03:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2022-11-19 07:03:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 104 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2022-11-19 07:03:15,638 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 16 [2022-11-19 07:03:15,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:15,639 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2022-11-19 07:03:15,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2022-11-19 07:03:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:03:15,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:15,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:15,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 07:03:15,640 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash 193251577, now seen corresponding path program 1 times [2022-11-19 07:03:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:15,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545676318] [2022-11-19 07:03:15,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:15,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:15,858 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-19 07:03:15,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:15,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545676318] [2022-11-19 07:03:15,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545676318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:15,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:15,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:03:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349605954] [2022-11-19 07:03:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:15,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:03:15,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:15,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:03:15,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:03:15,862 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:16,104 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2022-11-19 07:03:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:03:16,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 07:03:16,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:16,106 INFO L225 Difference]: With dead ends: 146 [2022-11-19 07:03:16,106 INFO L226 Difference]: Without dead ends: 146 [2022-11-19 07:03:16,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:03:16,107 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 244 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:16,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 202 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:03:16,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-19 07:03:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2022-11-19 07:03:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 107 states have internal predecessors, (128), 0 states have call successors, (0), 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-19 07:03:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2022-11-19 07:03:16,110 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 17 [2022-11-19 07:03:16,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:16,110 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2022-11-19 07:03:16,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:16,110 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-11-19 07:03:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:03:16,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:16,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:16,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 07:03:16,115 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash -403091939, now seen corresponding path program 1 times [2022-11-19 07:03:16,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:16,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230072580] [2022-11-19 07:03:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:16,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:16,403 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-19 07:03:16,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:16,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230072580] [2022-11-19 07:03:16,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230072580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:16,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:16,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:03:16,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572367653] [2022-11-19 07:03:16,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:16,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:03:16,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:16,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:03:16,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:03:16,406 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:16,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:16,706 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2022-11-19 07:03:16,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:03:16,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 07:03:16,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:16,707 INFO L225 Difference]: With dead ends: 128 [2022-11-19 07:03:16,707 INFO L226 Difference]: Without dead ends: 128 [2022-11-19 07:03:16,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:03:16,708 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 192 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:16,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 186 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:03:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-19 07:03:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 112. [2022-11-19 07:03:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-11-19 07:03:16,711 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 17 [2022-11-19 07:03:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:16,714 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-11-19 07:03:16,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-11-19 07:03:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:03:16,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:16,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:16,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 07:03:16,716 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash -403091938, now seen corresponding path program 1 times [2022-11-19 07:03:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:16,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066846938] [2022-11-19 07:03:16,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:17,028 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-19 07:03:17,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:17,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066846938] [2022-11-19 07:03:17,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066846938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:17,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:17,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:03:17,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951144168] [2022-11-19 07:03:17,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:17,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:03:17,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:17,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:03:17,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:03:17,031 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:17,284 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2022-11-19 07:03:17,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:03:17,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 07:03:17,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:17,286 INFO L225 Difference]: With dead ends: 139 [2022-11-19 07:03:17,286 INFO L226 Difference]: Without dead ends: 139 [2022-11-19 07:03:17,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:03:17,286 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 178 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:17,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 150 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:03:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-19 07:03:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2022-11-19 07:03:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.434782608695652) internal successors, (132), 111 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2022-11-19 07:03:17,290 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 17 [2022-11-19 07:03:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:17,290 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2022-11-19 07:03:17,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2022-11-19 07:03:17,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:03:17,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:17,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:17,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-19 07:03:17,295 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:17,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:17,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1693608402, now seen corresponding path program 1 times [2022-11-19 07:03:17,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:17,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472075963] [2022-11-19 07:03:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:17,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:17,539 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-19 07:03:17,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:17,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472075963] [2022-11-19 07:03:17,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472075963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:17,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:17,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:03:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055111098] [2022-11-19 07:03:17,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:17,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:03:17,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:17,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:03:17,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:03:17,543 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:17,761 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2022-11-19 07:03:17,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:03:17,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-19 07:03:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:17,762 INFO L225 Difference]: With dead ends: 126 [2022-11-19 07:03:17,762 INFO L226 Difference]: Without dead ends: 122 [2022-11-19 07:03:17,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:03:17,763 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 141 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:17,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 199 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:03:17,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-19 07:03:17,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2022-11-19 07:03:17,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 109 states have internal predecessors, (129), 0 states have call successors, (0), 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-19 07:03:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2022-11-19 07:03:17,766 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 18 [2022-11-19 07:03:17,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:17,766 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2022-11-19 07:03:17,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2022-11-19 07:03:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:03:17,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:17,771 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:17,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-19 07:03:17,771 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:17,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:17,772 INFO L85 PathProgramCache]: Analyzing trace with hash 303022428, now seen corresponding path program 1 times [2022-11-19 07:03:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:17,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037301591] [2022-11-19 07:03:17,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:03:18,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:18,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037301591] [2022-11-19 07:03:18,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037301591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:03:18,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811944854] [2022-11-19 07:03:18,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:18,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:03:18,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:03:18,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:03:18,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:03:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:18,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-19 07:03:18,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:03:18,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:03:18,375 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 07:03:18,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 07:03:18,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:03:18,521 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:03:18,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-11-19 07:03:18,562 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:03:18,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-11-19 07:03:18,638 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:03:18,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-19 07:03:18,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-19 07:03:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:03:18,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:03:18,714 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_451 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-19 07:03:18,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:03:18,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-11-19 07:03:18,838 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:03:18,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2022-11-19 07:03:18,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-19 07:03:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-19 07:03:19,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811944854] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:03:19,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2131123099] [2022-11-19 07:03:19,066 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-19 07:03:19,067 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:03:19,071 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:03:19,077 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:03:19,078 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:03:19,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 07:03:19,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-19 07:03:19,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:03:19,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:03:19,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-19 07:03:19,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-19 07:03:19,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-19 07:03:19,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 07:03:19,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-19 07:03:19,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-19 07:03:19,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-19 07:03:19,437 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-19 07:03:19,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 47 [2022-11-19 07:03:19,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-19 07:03:19,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-19 07:03:19,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2022-11-19 07:03:19,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-19 07:03:19,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-19 07:03:19,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2022-11-19 07:03:19,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-19 07:03:19,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-19 07:03:19,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2022-11-19 07:03:19,856 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-11-19 07:03:19,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 199 treesize of output 120 [2022-11-19 07:03:19,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2022-11-19 07:03:19,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:19,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2022-11-19 07:03:20,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:20,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:20,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:03:20,106 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-19 07:03:20,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 459 treesize of output 364 [2022-11-19 07:03:20,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:20,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:20,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:03:20,137 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-19 07:03:20,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 459 treesize of output 437 [2022-11-19 07:03:20,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:20,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:20,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:20,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:20,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:03:20,212 INFO L321 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-11-19 07:03:20,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 453 treesize of output 455 [2022-11-19 07:03:20,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:20,656 INFO L321 Elim1Store]: treesize reduction 278, result has 12.0 percent of original size [2022-11-19 07:03:20,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 461 treesize of output 468 [2022-11-19 07:03:20,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:03:20,984 INFO L321 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2022-11-19 07:03:20,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 555 treesize of output 440 [2022-11-19 07:03:21,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:21,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:21,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:21,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:21,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:03:21,121 INFO L321 Elim1Store]: treesize reduction 170, result has 17.1 percent of original size [2022-11-19 07:03:21,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 504 treesize of output 490 [2022-11-19 07:03:21,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:03:21,206 INFO L321 Elim1Store]: treesize reduction 100, result has 16.0 percent of original size [2022-11-19 07:03:21,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 491 treesize of output 477 [2022-11-19 07:03:21,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:03:21,911 INFO L321 Elim1Store]: treesize reduction 176, result has 15.8 percent of original size [2022-11-19 07:03:21,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 812 treesize of output 506 [2022-11-19 07:03:21,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:03:22,081 INFO L321 Elim1Store]: treesize reduction 188, result has 17.9 percent of original size [2022-11-19 07:03:22,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 823 treesize of output 721 [2022-11-19 07:03:22,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:22,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:22,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:03:22,313 INFO L321 Elim1Store]: treesize reduction 424, result has 12.9 percent of original size [2022-11-19 07:03:22,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 760 treesize of output 741 [2022-11-19 07:03:22,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 07:03:22,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:03:22,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 07:03:22,650 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:03:22,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 07:03:22,674 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:03:22,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 07:03:22,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:03:22,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-19 07:03:22,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:03:22,831 INFO L321 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2022-11-19 07:03:22,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 173 [2022-11-19 07:03:22,903 INFO L321 Elim1Store]: treesize reduction 60, result has 39.4 percent of original size [2022-11-19 07:03:22,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 162 [2022-11-19 07:03:22,968 INFO L321 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2022-11-19 07:03:22,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 145 [2022-11-19 07:03:23,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 07:03:23,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 07:03:23,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:03:23,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 07:03:23,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:03:23,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 07:03:23,339 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:03:23,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 07:03:23,381 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:03:23,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 07:03:23,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:03:23,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:03:23,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:03:23,424 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:03:24,192 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4303#(and (= |ULTIMATE.start_main_~state~0#1| 1) (<= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_85| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (and (<= (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_71|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_85|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_85|) 1) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_85|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_71|)) |ULTIMATE.start_main_~state~0#1|) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 07:03:24,193 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:03:24,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:03:24,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2022-11-19 07:03:24,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91124253] [2022-11-19 07:03:24,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:03:24,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-19 07:03:24,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:24,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-19 07:03:24,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=881, Unknown=5, NotChecked=60, Total=1056 [2022-11-19 07:03:24,195 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 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-19 07:03:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:25,015 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2022-11-19 07:03:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-19 07:03:25,015 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-19 07:03:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:25,016 INFO L225 Difference]: With dead ends: 212 [2022-11-19 07:03:25,017 INFO L226 Difference]: Without dead ends: 212 [2022-11-19 07:03:25,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=208, Invalid=1424, Unknown=12, NotChecked=78, Total=1722 [2022-11-19 07:03:25,018 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 345 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:25,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 504 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 298 Unchecked, 0.5s Time] [2022-11-19 07:03:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-19 07:03:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 128. [2022-11-19 07:03:25,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 127 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 150 transitions. [2022-11-19 07:03:25,023 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 150 transitions. Word has length 18 [2022-11-19 07:03:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:25,023 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 150 transitions. [2022-11-19 07:03:25,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 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-19 07:03:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 150 transitions. [2022-11-19 07:03:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:03:25,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:25,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:25,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:03:25,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:03:25,231 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:25,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:25,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1031178538, now seen corresponding path program 1 times [2022-11-19 07:03:25,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:25,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264384659] [2022-11-19 07:03:25,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:03:25,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:25,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264384659] [2022-11-19 07:03:25,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264384659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:25,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:25,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-19 07:03:25,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867578082] [2022-11-19 07:03:25,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:25,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 07:03:25,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:25,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 07:03:25,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:03:25,578 INFO L87 Difference]: Start difference. First operand 128 states and 150 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:25,890 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-11-19 07:03:25,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 07:03:25,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 07:03:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:25,891 INFO L225 Difference]: With dead ends: 130 [2022-11-19 07:03:25,891 INFO L226 Difference]: Without dead ends: 127 [2022-11-19 07:03:25,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-11-19 07:03:25,892 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 143 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:25,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 302 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:03:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-19 07:03:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2022-11-19 07:03:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.4) internal successors, (133), 114 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2022-11-19 07:03:25,896 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 19 [2022-11-19 07:03:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:25,896 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2022-11-19 07:03:25,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:03:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2022-11-19 07:03:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:03:25,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:25,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:25,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-19 07:03:25,898 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-19 07:03:25,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:25,898 INFO L85 PathProgramCache]: Analyzing trace with hash -824217396, now seen corresponding path program 1 times [2022-11-19 07:03:25,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:25,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44824828] [2022-11-19 07:03:25,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:25,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:03:25,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:03:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:03:25,956 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:03:25,958 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:03:25,959 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (45 of 46 remaining) [2022-11-19 07:03:25,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 46 remaining) [2022-11-19 07:03:25,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 46 remaining) [2022-11-19 07:03:25,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 46 remaining) [2022-11-19 07:03:25,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 46 remaining) [2022-11-19 07:03:25,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 46 remaining) [2022-11-19 07:03:25,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 46 remaining) [2022-11-19 07:03:25,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 46 remaining) [2022-11-19 07:03:25,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 46 remaining) [2022-11-19 07:03:25,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 46 remaining) [2022-11-19 07:03:25,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 46 remaining) [2022-11-19 07:03:25,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 46 remaining) [2022-11-19 07:03:25,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 46 remaining) [2022-11-19 07:03:25,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (32 of 46 remaining) [2022-11-19 07:03:25,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 46 remaining) [2022-11-19 07:03:25,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 46 remaining) [2022-11-19 07:03:25,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 46 remaining) [2022-11-19 07:03:25,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 46 remaining) [2022-11-19 07:03:25,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK (27 of 46 remaining) [2022-11-19 07:03:25,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 46 remaining) [2022-11-19 07:03:25,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 46 remaining) [2022-11-19 07:03:25,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 46 remaining) [2022-11-19 07:03:25,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 46 remaining) [2022-11-19 07:03:25,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 46 remaining) [2022-11-19 07:03:25,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 46 remaining) [2022-11-19 07:03:25,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 46 remaining) [2022-11-19 07:03:25,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 46 remaining) [2022-11-19 07:03:25,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 46 remaining) [2022-11-19 07:03:25,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 46 remaining) [2022-11-19 07:03:25,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 46 remaining) [2022-11-19 07:03:25,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 46 remaining) [2022-11-19 07:03:25,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 46 remaining) [2022-11-19 07:03:25,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 46 remaining) [2022-11-19 07:03:25,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 46 remaining) [2022-11-19 07:03:25,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 46 remaining) [2022-11-19 07:03:25,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 46 remaining) [2022-11-19 07:03:25,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 46 remaining) [2022-11-19 07:03:25,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 46 remaining) [2022-11-19 07:03:25,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 46 remaining) [2022-11-19 07:03:25,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (6 of 46 remaining) [2022-11-19 07:03:25,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (5 of 46 remaining) [2022-11-19 07:03:25,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (4 of 46 remaining) [2022-11-19 07:03:25,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (3 of 46 remaining) [2022-11-19 07:03:25,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (2 of 46 remaining) [2022-11-19 07:03:25,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (1 of 46 remaining) [2022-11-19 07:03:25,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (0 of 46 remaining) [2022-11-19 07:03:25,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-19 07:03:25,977 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:25,981 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:03:26,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:03:26 BoogieIcfgContainer [2022-11-19 07:03:26,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:03:26,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:03:26,017 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:03:26,017 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:03:26,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:03:08" (3/4) ... [2022-11-19 07:03:26,019 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 07:03:26,051 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:03:26,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:03:26,051 INFO L158 Benchmark]: Toolchain (without parser) took 18784.14ms. Allocated memory was 127.9MB in the beginning and 232.8MB in the end (delta: 104.9MB). Free memory was 92.5MB in the beginning and 181.9MB in the end (delta: -89.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2022-11-19 07:03:26,052 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 127.9MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:03:26,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.13ms. Allocated memory is still 127.9MB. Free memory was 92.4MB in the beginning and 97.4MB in the end (delta: -5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:03:26,052 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.42ms. Allocated memory is still 127.9MB. Free memory was 97.4MB in the beginning and 95.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:03:26,052 INFO L158 Benchmark]: Boogie Preprocessor took 31.54ms. Allocated memory is still 127.9MB. Free memory was 95.8MB in the beginning and 93.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:03:26,053 INFO L158 Benchmark]: RCFGBuilder took 772.66ms. Allocated memory is still 127.9MB. Free memory was 93.7MB in the beginning and 70.1MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-19 07:03:26,053 INFO L158 Benchmark]: TraceAbstraction took 17448.03ms. Allocated memory was 127.9MB in the beginning and 232.8MB in the end (delta: 104.9MB). Free memory was 69.6MB in the beginning and 183.9MB in the end (delta: -114.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:03:26,053 INFO L158 Benchmark]: Witness Printer took 34.32ms. Allocated memory is still 232.8MB. Free memory was 183.9MB in the beginning and 181.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:03:26,055 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.29ms. Allocated memory is still 127.9MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.13ms. Allocated memory is still 127.9MB. Free memory was 92.4MB in the beginning and 97.4MB in the end (delta: -5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.42ms. Allocated memory is still 127.9MB. Free memory was 97.4MB in the beginning and 95.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.54ms. Allocated memory is still 127.9MB. Free memory was 95.8MB in the beginning and 93.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 772.66ms. Allocated memory is still 127.9MB. Free memory was 93.7MB in the beginning and 70.1MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17448.03ms. Allocated memory was 127.9MB in the beginning and 232.8MB in the end (delta: 104.9MB). Free memory was 69.6MB in the beginning and 183.9MB in the end (delta: -114.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 34.32ms. Allocated memory is still 232.8MB. Free memory was 183.9MB in the beginning and 181.9MB 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: 1032]: 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 = head VAL [head={-1:0}] [L998] head->data = 0 [L1000] SLL* x = head; [L1001] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1027] EXPR head->next [L1027] x = head->next [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1030] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1030] COND TRUE x->data != 0 [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1032] EXPR x->next->data [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next->data [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1032] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1032] reach_error() VAL [head={-1:0}, state=1, x={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: 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, 90 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3123 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3123 mSDsluCounter, 3505 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 298 IncrementalHoareTripleChecker+Unchecked, 2574 mSDsCounter, 238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3460 IncrementalHoareTripleChecker+Invalid, 3996 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 238 mSolverCounterUnsat, 931 mSDtfsCounter, 3460 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 178 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=20, InterpolantAutomatonStates: 157, 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, 21 MinimizatonAttempts, 528 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 265 ConstructedInterpolants, 11 QuantifiedInterpolants, 3394 SizeOfPredicates, 5 NumberOfNonLiveVariables, 182 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 1/7 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-19 07:03:26,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d34907d-c089-4f85-81cb-e9654a4951a3/bin/utaipan-I9t0OCRTmS/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)