./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-ext/04_incdec_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/04_incdec_cas.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a025fe4ca65874bde9a09e6a2d9fa9eceda581ed1bc5b23e0ff5285795ed115b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 14:12:35,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:12:35,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:12:35,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:12:35,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:12:35,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:12:35,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:12:35,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:12:35,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:12:35,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:12:35,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:12:35,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:12:35,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:12:35,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:12:35,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:12:35,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:12:35,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:12:35,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:12:35,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:12:35,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:12:35,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:12:35,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:12:35,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:12:35,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:12:35,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:12:35,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:12:35,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:12:35,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:12:35,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:12:35,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:12:35,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:12:35,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:12:35,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:12:35,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:12:35,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:12:35,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:12:35,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:12:35,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:12:35,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:12:35,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:12:35,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:12:35,970 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 14:12:35,993 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:12:35,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:12:35,993 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:12:35,993 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:12:35,994 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:12:35,994 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:12:35,995 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:12:35,995 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:12:35,995 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:12:35,995 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:12:35,995 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:12:35,995 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:12:35,996 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:12:35,996 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:12:35,996 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:12:35,996 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:12:35,997 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:12:35,997 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:12:35,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 14:12:35,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 14:12:35,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:12:35,998 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:12:35,998 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 14:12:35,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:12:35,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:12:35,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:12:35,999 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 14:12:35,999 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 14:12:35,999 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 14:12:36,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:12:36,000 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 14:12:36,000 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:12:36,000 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:12:36,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:12:36,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:12:36,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:12:36,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:12:36,001 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:12:36,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:12:36,002 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:12:36,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:12:36,002 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:12:36,002 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_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a025fe4ca65874bde9a09e6a2d9fa9eceda581ed1bc5b23e0ff5285795ed115b [2022-12-14 14:12:36,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:12:36,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:12:36,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:12:36,190 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:12:36,191 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:12:36,191 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-ext/04_incdec_cas.i [2022-12-14 14:12:38,771 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:12:38,952 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:12:38,952 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/sv-benchmarks/c/pthread-ext/04_incdec_cas.i [2022-12-14 14:12:38,961 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/data/c88f98176/48323d30b173408688600158da21d3ad/FLAGa736b464e [2022-12-14 14:12:39,343 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/data/c88f98176/48323d30b173408688600158da21d3ad [2022-12-14 14:12:39,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:12:39,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:12:39,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:12:39,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:12:39,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:12:39,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:12:39" (1/1) ... [2022-12-14 14:12:39,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d753b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39, skipping insertion in model container [2022-12-14 14:12:39,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:12:39" (1/1) ... [2022-12-14 14:12:39,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:12:39,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:12:39,597 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30285,30298] [2022-12-14 14:12:39,604 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30729,30742] [2022-12-14 14:12:39,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:12:39,617 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:12:39,643 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30285,30298] [2022-12-14 14:12:39,645 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30729,30742] [2022-12-14 14:12:39,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:12:39,667 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:12:39,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39 WrapperNode [2022-12-14 14:12:39,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:12:39,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:12:39,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:12:39,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:12:39,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39" (1/1) ... [2022-12-14 14:12:39,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39" (1/1) ... [2022-12-14 14:12:39,699 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2022-12-14 14:12:39,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:12:39,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:12:39,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:12:39,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:12:39,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39" (1/1) ... [2022-12-14 14:12:39,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39" (1/1) ... [2022-12-14 14:12:39,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39" (1/1) ... [2022-12-14 14:12:39,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39" (1/1) ... [2022-12-14 14:12:39,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39" (1/1) ... [2022-12-14 14:12:39,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39" (1/1) ... [2022-12-14 14:12:39,720 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39" (1/1) ... [2022-12-14 14:12:39,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39" (1/1) ... [2022-12-14 14:12:39,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:12:39,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:12:39,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:12:39,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:12:39,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39" (1/1) ... [2022-12-14 14:12:39,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:12:39,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:12:39,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:12:39,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:12:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 14:12:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-12-14 14:12:39,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-12-14 14:12:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 14:12:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:12:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 14:12:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 14:12:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 14:12:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:12:39,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:12:39,790 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 14:12:39,879 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:12:39,881 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:12:40,175 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:12:40,394 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:12:40,394 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 14:12:40,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:12:40 BoogieIcfgContainer [2022-12-14 14:12:40,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:12:40,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:12:40,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:12:40,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:12:40,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:12:39" (1/3) ... [2022-12-14 14:12:40,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d1377e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:12:40, skipping insertion in model container [2022-12-14 14:12:40,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:12:39" (2/3) ... [2022-12-14 14:12:40,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d1377e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:12:40, skipping insertion in model container [2022-12-14 14:12:40,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:12:40" (3/3) ... [2022-12-14 14:12:40,402 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2022-12-14 14:12:40,415 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:12:40,415 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-12-14 14:12:40,415 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 14:12:40,499 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 14:12:40,522 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 14:12:40,533 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 147 transitions, 299 flow [2022-12-14 14:12:40,535 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 147 transitions, 299 flow [2022-12-14 14:12:40,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 147 transitions, 299 flow [2022-12-14 14:12:40,580 INFO L130 PetriNetUnfolder]: 9/163 cut-off events. [2022-12-14 14:12:40,580 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 14:12:40,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 163 events. 9/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 570 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 122. Up to 4 conditions per place. [2022-12-14 14:12:40,586 INFO L119 LiptonReduction]: Number of co-enabled transitions 3952 [2022-12-14 14:12:48,834 INFO L134 LiptonReduction]: Checked pairs total: 6787 [2022-12-14 14:12:48,834 INFO L136 LiptonReduction]: Total number of compositions: 138 [2022-12-14 14:12:48,839 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 67 transitions, 139 flow [2022-12-14 14:12:48,867 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 417 states, 220 states have (on average 3.731818181818182) internal successors, (821), 416 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:48,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:12:48,885 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;@6b173ca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:12:48,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-12-14 14:12:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 417 states, 220 states have (on average 3.731818181818182) internal successors, (821), 416 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 14:12:48,891 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:12:48,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 14:12:48,892 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-14 14:12:48,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:12:48,895 INFO L85 PathProgramCache]: Analyzing trace with hash 26967, now seen corresponding path program 1 times [2022-12-14 14:12:48,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:12:48,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874992948] [2022-12-14 14:12:48,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:12:48,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:12:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:12:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:12:49,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:12:49,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874992948] [2022-12-14 14:12:49,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874992948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:12:49,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:12:49,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:12:49,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660310059] [2022-12-14 14:12:49,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:12:49,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 14:12:49,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:12:49,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 14:12:49,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 14:12:49,056 INFO L87 Difference]: Start difference. First operand has 417 states, 220 states have (on average 3.731818181818182) internal successors, (821), 416 states have internal predecessors, (821), 0 states have call successors, (0), 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 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:12:49,154 INFO L93 Difference]: Finished difference Result 245 states and 469 transitions. [2022-12-14 14:12:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 14:12:49,156 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 14:12:49,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:12:49,163 INFO L225 Difference]: With dead ends: 245 [2022-12-14 14:12:49,163 INFO L226 Difference]: Without dead ends: 245 [2022-12-14 14:12:49,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 14:12:49,166 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:12:49,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:12:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-12-14 14:12:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2022-12-14 14:12:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 162 states have (on average 2.8950617283950617) internal successors, (469), 244 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 469 transitions. [2022-12-14 14:12:49,198 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 469 transitions. Word has length 2 [2022-12-14 14:12:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:12:49,199 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 469 transitions. [2022-12-14 14:12:49,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 469 transitions. [2022-12-14 14:12:49,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 14:12:49,199 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:12:49,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 14:12:49,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 14:12:49,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-14 14:12:49,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:12:49,200 INFO L85 PathProgramCache]: Analyzing trace with hash 26984, now seen corresponding path program 1 times [2022-12-14 14:12:49,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:12:49,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958916472] [2022-12-14 14:12:49,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:12:49,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:12:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:12:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:12:49,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:12:49,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958916472] [2022-12-14 14:12:49,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958916472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:12:49,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:12:49,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:12:49,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021670002] [2022-12-14 14:12:49,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:12:49,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:12:49,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:12:49,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:12:49,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:12:49,258 INFO L87 Difference]: Start difference. First operand 245 states and 469 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:12:49,343 INFO L93 Difference]: Finished difference Result 207 states and 386 transitions. [2022-12-14 14:12:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:12:49,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 14:12:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:12:49,345 INFO L225 Difference]: With dead ends: 207 [2022-12-14 14:12:49,345 INFO L226 Difference]: Without dead ends: 207 [2022-12-14 14:12:49,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:12:49,346 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:12:49,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:12:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-12-14 14:12:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2022-12-14 14:12:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 149 states have (on average 2.5838926174496644) internal successors, (385), 204 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 385 transitions. [2022-12-14 14:12:49,355 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 385 transitions. Word has length 2 [2022-12-14 14:12:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:12:49,356 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 385 transitions. [2022-12-14 14:12:49,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 385 transitions. [2022-12-14 14:12:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 14:12:49,356 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:12:49,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 14:12:49,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 14:12:49,356 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-14 14:12:49,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:12:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash 26985, now seen corresponding path program 1 times [2022-12-14 14:12:49,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:12:49,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360547148] [2022-12-14 14:12:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:12:49,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:12:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:12:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:12:49,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:12:49,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360547148] [2022-12-14 14:12:49,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360547148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:12:49,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:12:49,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:12:49,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488206613] [2022-12-14 14:12:49,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:12:49,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:12:49,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:12:49,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:12:49,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:12:49,421 INFO L87 Difference]: Start difference. First operand 205 states and 385 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:12:49,501 INFO L93 Difference]: Finished difference Result 164 states and 300 transitions. [2022-12-14 14:12:49,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:12:49,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 14:12:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:12:49,503 INFO L225 Difference]: With dead ends: 164 [2022-12-14 14:12:49,504 INFO L226 Difference]: Without dead ends: 164 [2022-12-14 14:12:49,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:12:49,505 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:12:49,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:12:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-12-14 14:12:49,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-12-14 14:12:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 136 states have (on average 2.2058823529411766) internal successors, (300), 163 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 300 transitions. [2022-12-14 14:12:49,511 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 300 transitions. Word has length 2 [2022-12-14 14:12:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:12:49,511 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 300 transitions. [2022-12-14 14:12:49,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 300 transitions. [2022-12-14 14:12:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 14:12:49,512 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:12:49,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 14:12:49,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 14:12:49,512 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-14 14:12:49,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:12:49,512 INFO L85 PathProgramCache]: Analyzing trace with hash 804525894, now seen corresponding path program 1 times [2022-12-14 14:12:49,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:12:49,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264223280] [2022-12-14 14:12:49,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:12:49,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:12:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:12:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:12:49,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:12:49,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264223280] [2022-12-14 14:12:49,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264223280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:12:49,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:12:49,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:12:49,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970948326] [2022-12-14 14:12:49,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:12:49,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:12:49,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:12:49,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:12:49,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:12:49,608 INFO L87 Difference]: Start difference. First operand 164 states and 300 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:12:49,699 INFO L93 Difference]: Finished difference Result 148 states and 272 transitions. [2022-12-14 14:12:49,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:12:49,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-12-14 14:12:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:12:49,701 INFO L225 Difference]: With dead ends: 148 [2022-12-14 14:12:49,701 INFO L226 Difference]: Without dead ends: 148 [2022-12-14 14:12:49,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:12:49,702 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 74 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:12:49,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 3 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:12:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-12-14 14:12:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-12-14 14:12:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 124 states have (on average 2.193548387096774) internal successors, (272), 147 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 272 transitions. [2022-12-14 14:12:49,712 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 272 transitions. Word has length 5 [2022-12-14 14:12:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:12:49,713 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 272 transitions. [2022-12-14 14:12:49,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 272 transitions. [2022-12-14 14:12:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 14:12:49,713 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:12:49,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 14:12:49,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 14:12:49,714 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-14 14:12:49,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:12:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash 804525895, now seen corresponding path program 1 times [2022-12-14 14:12:49,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:12:49,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179850337] [2022-12-14 14:12:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:12:49,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:12:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:12:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:12:49,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:12:49,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179850337] [2022-12-14 14:12:49,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179850337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:12:49,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:12:49,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:12:49,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971838899] [2022-12-14 14:12:49,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:12:49,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:12:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:12:49,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:12:49,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:12:49,807 INFO L87 Difference]: Start difference. First operand 148 states and 272 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:12:49,892 INFO L93 Difference]: Finished difference Result 132 states and 244 transitions. [2022-12-14 14:12:49,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:12:49,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-12-14 14:12:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:12:49,893 INFO L225 Difference]: With dead ends: 132 [2022-12-14 14:12:49,893 INFO L226 Difference]: Without dead ends: 132 [2022-12-14 14:12:49,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:12:49,894 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:12:49,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:12:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-12-14 14:12:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-12-14 14:12:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 112 states have (on average 2.1785714285714284) internal successors, (244), 131 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 244 transitions. [2022-12-14 14:12:49,900 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 244 transitions. Word has length 5 [2022-12-14 14:12:49,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:12:49,900 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 244 transitions. [2022-12-14 14:12:49,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:12:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 244 transitions. [2022-12-14 14:12:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 14:12:49,901 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:12:49,901 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-12-14 14:12:49,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 14:12:49,902 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-14 14:12:49,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:12:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash -829594348, now seen corresponding path program 1 times [2022-12-14 14:12:49,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:12:49,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978410187] [2022-12-14 14:12:49,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:12:49,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:12:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 14:12:49,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 14:12:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 14:12:49,936 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 14:12:49,936 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 14:12:49,937 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (79 of 80 remaining) [2022-12-14 14:12:49,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2022-12-14 14:12:49,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2022-12-14 14:12:49,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 80 remaining) [2022-12-14 14:12:49,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2022-12-14 14:12:49,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2022-12-14 14:12:49,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2022-12-14 14:12:49,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2022-12-14 14:12:49,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2022-12-14 14:12:49,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONMEMORY_LEAK (70 of 80 remaining) [2022-12-14 14:12:49,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2022-12-14 14:12:49,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2022-12-14 14:12:49,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2022-12-14 14:12:49,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2022-12-14 14:12:49,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37ASSERT_VIOLATIONMEMORY_LEAK (65 of 80 remaining) [2022-12-14 14:12:49,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2022-12-14 14:12:49,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2022-12-14 14:12:49,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2022-12-14 14:12:49,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2022-12-14 14:12:49,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2022-12-14 14:12:49,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 80 remaining) [2022-12-14 14:12:49,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2022-12-14 14:12:49,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2022-12-14 14:12:49,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2022-12-14 14:12:49,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2022-12-14 14:12:49,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2022-12-14 14:12:49,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2022-12-14 14:12:49,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 80 remaining) [2022-12-14 14:12:49,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 80 remaining) [2022-12-14 14:12:49,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2022-12-14 14:12:49,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2022-12-14 14:12:49,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2022-12-14 14:12:49,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2022-12-14 14:12:49,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2022-12-14 14:12:49,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2022-12-14 14:12:49,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2022-12-14 14:12:49,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2022-12-14 14:12:49,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2022-12-14 14:12:49,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2022-12-14 14:12:49,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2022-12-14 14:12:49,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2022-12-14 14:12:49,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (38 of 80 remaining) [2022-12-14 14:12:49,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 80 remaining) [2022-12-14 14:12:49,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2022-12-14 14:12:49,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2022-12-14 14:12:49,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 80 remaining) [2022-12-14 14:12:49,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 80 remaining) [2022-12-14 14:12:49,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 80 remaining) [2022-12-14 14:12:49,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 80 remaining) [2022-12-14 14:12:49,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 80 remaining) [2022-12-14 14:12:49,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONMEMORY_LEAK (29 of 80 remaining) [2022-12-14 14:12:49,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2022-12-14 14:12:49,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 80 remaining) [2022-12-14 14:12:49,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2022-12-14 14:12:49,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2022-12-14 14:12:49,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37ASSERT_VIOLATIONMEMORY_LEAK (24 of 80 remaining) [2022-12-14 14:12:49,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2022-12-14 14:12:49,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2022-12-14 14:12:49,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2022-12-14 14:12:49,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 80 remaining) [2022-12-14 14:12:49,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2022-12-14 14:12:49,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2022-12-14 14:12:49,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2022-12-14 14:12:49,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2022-12-14 14:12:49,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 80 remaining) [2022-12-14 14:12:49,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2022-12-14 14:12:49,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2022-12-14 14:12:49,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 80 remaining) [2022-12-14 14:12:49,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2022-12-14 14:12:49,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2022-12-14 14:12:49,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 80 remaining) [2022-12-14 14:12:49,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 80 remaining) [2022-12-14 14:12:49,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 80 remaining) [2022-12-14 14:12:49,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 80 remaining) [2022-12-14 14:12:49,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2022-12-14 14:12:49,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2022-12-14 14:12:49,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 80 remaining) [2022-12-14 14:12:49,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 80 remaining) [2022-12-14 14:12:49,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 80 remaining) [2022-12-14 14:12:49,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 80 remaining) [2022-12-14 14:12:49,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 14:12:49,951 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-12-14 14:12:49,953 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-14 14:12:49,953 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-12-14 14:12:50,026 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 14:12:50,029 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 14:12:50,029 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 242 places, 252 transitions, 516 flow [2022-12-14 14:12:50,029 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 242 places, 252 transitions, 516 flow [2022-12-14 14:12:50,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 252 transitions, 516 flow [2022-12-14 14:12:50,083 INFO L130 PetriNetUnfolder]: 17/286 cut-off events. [2022-12-14 14:12:50,083 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 14:12:50,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 286 events. 17/286 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1353 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 226. Up to 6 conditions per place. [2022-12-14 14:12:50,094 INFO L119 LiptonReduction]: Number of co-enabled transitions 29744 [2022-12-14 14:13:04,158 INFO L134 LiptonReduction]: Checked pairs total: 65274 [2022-12-14 14:13:04,158 INFO L136 LiptonReduction]: Total number of compositions: 207 [2022-12-14 14:13:04,158 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 117 places, 126 transitions, 264 flow [2022-12-14 14:13:04,634 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24265 states, 16503 states have (on average 4.562806762406835) internal successors, (75300), 24264 states have internal predecessors, (75300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:04,635 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:13:04,636 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;@6b173ca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:13:04,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 118 error locations. [2022-12-14 14:13:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 24265 states, 16503 states have (on average 4.562806762406835) internal successors, (75300), 24264 states have internal predecessors, (75300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 14:13:04,688 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:04,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 14:13:04,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:04,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash 45007, now seen corresponding path program 1 times [2022-12-14 14:13:04,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:04,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521361037] [2022-12-14 14:13:04,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:04,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:04,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:04,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521361037] [2022-12-14 14:13:04,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521361037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:04,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:04,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:13:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457640739] [2022-12-14 14:13:04,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:04,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:04,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:04,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:04,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:04,732 INFO L87 Difference]: Start difference. First operand has 24265 states, 16503 states have (on average 4.562806762406835) internal successors, (75300), 24264 states have internal predecessors, (75300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:05,151 INFO L93 Difference]: Finished difference Result 14248 states and 42023 transitions. [2022-12-14 14:13:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:05,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 14:13:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:05,223 INFO L225 Difference]: With dead ends: 14248 [2022-12-14 14:13:05,223 INFO L226 Difference]: Without dead ends: 14248 [2022-12-14 14:13:05,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:05,224 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 98 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:05,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 22 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:13:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14248 states. [2022-12-14 14:13:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14248 to 14014. [2022-12-14 14:13:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14014 states, 11458 states have (on average 3.6369348926514227) internal successors, (41672), 14013 states have internal predecessors, (41672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14014 states to 14014 states and 41672 transitions. [2022-12-14 14:13:05,646 INFO L78 Accepts]: Start accepts. Automaton has 14014 states and 41672 transitions. Word has length 2 [2022-12-14 14:13:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:05,647 INFO L495 AbstractCegarLoop]: Abstraction has 14014 states and 41672 transitions. [2022-12-14 14:13:05,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 14014 states and 41672 transitions. [2022-12-14 14:13:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 14:13:05,647 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:05,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 14:13:05,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 14:13:05,648 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:05,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash 45009, now seen corresponding path program 1 times [2022-12-14 14:13:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:05,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502468337] [2022-12-14 14:13:05,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:05,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:05,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:05,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502468337] [2022-12-14 14:13:05,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502468337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:05,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:05,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:13:05,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106553653] [2022-12-14 14:13:05,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:05,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:05,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:05,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:05,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:05,684 INFO L87 Difference]: Start difference. First operand 14014 states and 41672 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:05,867 INFO L93 Difference]: Finished difference Result 11709 states and 34377 transitions. [2022-12-14 14:13:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:05,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 14:13:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:05,901 INFO L225 Difference]: With dead ends: 11709 [2022-12-14 14:13:05,902 INFO L226 Difference]: Without dead ends: 11709 [2022-12-14 14:13:05,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:05,902 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:05,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 11 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:13:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11709 states. [2022-12-14 14:13:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11709 to 11709. [2022-12-14 14:13:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11709 states, 10414 states have (on average 3.301037065488765) internal successors, (34377), 11708 states have internal predecessors, (34377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11709 states to 11709 states and 34377 transitions. [2022-12-14 14:13:06,198 INFO L78 Accepts]: Start accepts. Automaton has 11709 states and 34377 transitions. Word has length 2 [2022-12-14 14:13:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:06,199 INFO L495 AbstractCegarLoop]: Abstraction has 11709 states and 34377 transitions. [2022-12-14 14:13:06,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 11709 states and 34377 transitions. [2022-12-14 14:13:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 14:13:06,199 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:06,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 14:13:06,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 14:13:06,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:06,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:06,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1342001036, now seen corresponding path program 1 times [2022-12-14 14:13:06,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:06,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696193423] [2022-12-14 14:13:06,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:06,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:06,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:06,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696193423] [2022-12-14 14:13:06,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696193423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:06,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:06,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:13:06,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612538438] [2022-12-14 14:13:06,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:06,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:13:06,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:06,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:13:06,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:13:06,277 INFO L87 Difference]: Start difference. First operand 11709 states and 34377 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:06,789 INFO L93 Difference]: Finished difference Result 9549 states and 27641 transitions. [2022-12-14 14:13:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:13:06,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-12-14 14:13:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:06,813 INFO L225 Difference]: With dead ends: 9549 [2022-12-14 14:13:06,813 INFO L226 Difference]: Without dead ends: 9549 [2022-12-14 14:13:06,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:13:06,814 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 238 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:06,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 28 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:13:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9549 states. [2022-12-14 14:13:06,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9549 to 9165. [2022-12-14 14:13:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9165 states, 8242 states have (on average 3.3096335840815336) internal successors, (27278), 9164 states have internal predecessors, (27278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9165 states to 9165 states and 27278 transitions. [2022-12-14 14:13:06,989 INFO L78 Accepts]: Start accepts. Automaton has 9165 states and 27278 transitions. Word has length 5 [2022-12-14 14:13:06,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:06,989 INFO L495 AbstractCegarLoop]: Abstraction has 9165 states and 27278 transitions. [2022-12-14 14:13:06,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 9165 states and 27278 transitions. [2022-12-14 14:13:06,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 14:13:06,990 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:06,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 14:13:06,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 14:13:06,990 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:06,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:06,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1342001037, now seen corresponding path program 1 times [2022-12-14 14:13:06,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:06,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292642755] [2022-12-14 14:13:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:06,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:07,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:07,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292642755] [2022-12-14 14:13:07,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292642755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:07,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:07,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:13:07,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88570470] [2022-12-14 14:13:07,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:07,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:13:07,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:07,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:13:07,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:13:07,107 INFO L87 Difference]: Start difference. First operand 9165 states and 27278 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:07,288 INFO L93 Difference]: Finished difference Result 6801 states and 20384 transitions. [2022-12-14 14:13:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-12-14 14:13:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:07,305 INFO L225 Difference]: With dead ends: 6801 [2022-12-14 14:13:07,305 INFO L226 Difference]: Without dead ends: 6801 [2022-12-14 14:13:07,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:13:07,305 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:07,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 7 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:13:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6801 states. [2022-12-14 14:13:07,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6801 to 6801. [2022-12-14 14:13:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6801 states, 6202 states have (on average 3.2866817155756207) internal successors, (20384), 6800 states have internal predecessors, (20384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6801 states to 6801 states and 20384 transitions. [2022-12-14 14:13:07,410 INFO L78 Accepts]: Start accepts. Automaton has 6801 states and 20384 transitions. Word has length 5 [2022-12-14 14:13:07,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:07,410 INFO L495 AbstractCegarLoop]: Abstraction has 6801 states and 20384 transitions. [2022-12-14 14:13:07,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6801 states and 20384 transitions. [2022-12-14 14:13:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 14:13:07,410 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:07,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 14:13:07,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 14:13:07,410 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:07,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:07,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1347631628, now seen corresponding path program 1 times [2022-12-14 14:13:07,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:07,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145016429] [2022-12-14 14:13:07,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:07,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:07,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:07,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145016429] [2022-12-14 14:13:07,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145016429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:07,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:07,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:13:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931955036] [2022-12-14 14:13:07,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:07,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:13:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:07,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:13:07,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:13:07,513 INFO L87 Difference]: Start difference. First operand 6801 states and 20384 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:07,789 INFO L93 Difference]: Finished difference Result 6123 states and 18392 transitions. [2022-12-14 14:13:07,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:07,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 14:13:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:07,801 INFO L225 Difference]: With dead ends: 6123 [2022-12-14 14:13:07,801 INFO L226 Difference]: Without dead ends: 6123 [2022-12-14 14:13:07,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:13:07,802 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:07,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 25 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:13:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6123 states. [2022-12-14 14:13:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6123 to 6123. [2022-12-14 14:13:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6123 states, 5608 states have (on average 3.2796005706134093) internal successors, (18392), 6122 states have internal predecessors, (18392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6123 states to 6123 states and 18392 transitions. [2022-12-14 14:13:07,887 INFO L78 Accepts]: Start accepts. Automaton has 6123 states and 18392 transitions. Word has length 6 [2022-12-14 14:13:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:07,887 INFO L495 AbstractCegarLoop]: Abstraction has 6123 states and 18392 transitions. [2022-12-14 14:13:07,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6123 states and 18392 transitions. [2022-12-14 14:13:07,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 14:13:07,888 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:07,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 14:13:07,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 14:13:07,888 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:07,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:07,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1347631627, now seen corresponding path program 1 times [2022-12-14 14:13:07,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:07,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18698681] [2022-12-14 14:13:07,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:08,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:08,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18698681] [2022-12-14 14:13:08,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18698681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:08,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:08,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:13:08,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779733198] [2022-12-14 14:13:08,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:08,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:13:08,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:08,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:13:08,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:13:08,028 INFO L87 Difference]: Start difference. First operand 6123 states and 18392 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:08,192 INFO L93 Difference]: Finished difference Result 5455 states and 16432 transitions. [2022-12-14 14:13:08,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:08,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 14:13:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:08,207 INFO L225 Difference]: With dead ends: 5455 [2022-12-14 14:13:08,207 INFO L226 Difference]: Without dead ends: 5455 [2022-12-14 14:13:08,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:13:08,208 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:08,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 11 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:13:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5455 states. [2022-12-14 14:13:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5455 to 5455. [2022-12-14 14:13:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5455 states, 5024 states have (on average 3.270700636942675) internal successors, (16432), 5454 states have internal predecessors, (16432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5455 states to 5455 states and 16432 transitions. [2022-12-14 14:13:08,338 INFO L78 Accepts]: Start accepts. Automaton has 5455 states and 16432 transitions. Word has length 6 [2022-12-14 14:13:08,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:08,338 INFO L495 AbstractCegarLoop]: Abstraction has 5455 states and 16432 transitions. [2022-12-14 14:13:08,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 5455 states and 16432 transitions. [2022-12-14 14:13:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 14:13:08,339 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:08,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 14:13:08,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 14:13:08,339 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:08,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1347631624, now seen corresponding path program 1 times [2022-12-14 14:13:08,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:08,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068229286] [2022-12-14 14:13:08,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:08,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:08,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:08,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068229286] [2022-12-14 14:13:08,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068229286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:08,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:08,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:13:08,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443968516] [2022-12-14 14:13:08,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:08,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:08,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:08,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:08,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:08,384 INFO L87 Difference]: Start difference. First operand 5455 states and 16432 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:08,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:08,669 INFO L93 Difference]: Finished difference Result 5077 states and 15221 transitions. [2022-12-14 14:13:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:08,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 14:13:08,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:08,684 INFO L225 Difference]: With dead ends: 5077 [2022-12-14 14:13:08,684 INFO L226 Difference]: Without dead ends: 5077 [2022-12-14 14:13:08,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:08,685 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 49 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:08,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 25 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:13:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5077 states. [2022-12-14 14:13:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5077 to 5005. [2022-12-14 14:13:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5005 states, 4628 states have (on average 3.2668539325842696) internal successors, (15119), 5004 states have internal predecessors, (15119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5005 states to 5005 states and 15119 transitions. [2022-12-14 14:13:08,795 INFO L78 Accepts]: Start accepts. Automaton has 5005 states and 15119 transitions. Word has length 6 [2022-12-14 14:13:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:08,795 INFO L495 AbstractCegarLoop]: Abstraction has 5005 states and 15119 transitions. [2022-12-14 14:13:08,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 5005 states and 15119 transitions. [2022-12-14 14:13:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 14:13:08,796 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:08,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 14:13:08,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 14:13:08,796 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:08,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1347631623, now seen corresponding path program 1 times [2022-12-14 14:13:08,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:08,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807297107] [2022-12-14 14:13:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:08,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:08,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:08,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807297107] [2022-12-14 14:13:08,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807297107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:08,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:08,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:13:08,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50187796] [2022-12-14 14:13:08,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:08,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:08,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:08,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:08,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:08,890 INFO L87 Difference]: Start difference. First operand 5005 states and 15119 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:09,119 INFO L93 Difference]: Finished difference Result 4525 states and 13697 transitions. [2022-12-14 14:13:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 14:13:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:09,131 INFO L225 Difference]: With dead ends: 4525 [2022-12-14 14:13:09,132 INFO L226 Difference]: Without dead ends: 4525 [2022-12-14 14:13:09,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:09,132 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 54 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:09,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 27 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:13:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states. [2022-12-14 14:13:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 4525. [2022-12-14 14:13:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4525 states, 4208 states have (on average 3.254990494296578) internal successors, (13697), 4524 states have internal predecessors, (13697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4525 states to 4525 states and 13697 transitions. [2022-12-14 14:13:09,240 INFO L78 Accepts]: Start accepts. Automaton has 4525 states and 13697 transitions. Word has length 6 [2022-12-14 14:13:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:09,240 INFO L495 AbstractCegarLoop]: Abstraction has 4525 states and 13697 transitions. [2022-12-14 14:13:09,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4525 states and 13697 transitions. [2022-12-14 14:13:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 14:13:09,241 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:09,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 14:13:09,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 14:13:09,241 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:09,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:09,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1347629736, now seen corresponding path program 1 times [2022-12-14 14:13:09,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:09,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720764676] [2022-12-14 14:13:09,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:09,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:09,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:09,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720764676] [2022-12-14 14:13:09,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720764676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:09,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:09,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:13:09,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444852274] [2022-12-14 14:13:09,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:09,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:13:09,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:09,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:13:09,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:13:09,342 INFO L87 Difference]: Start difference. First operand 4525 states and 13697 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:09,656 INFO L93 Difference]: Finished difference Result 3987 states and 12097 transitions. [2022-12-14 14:13:09,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:09,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 14:13:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:09,667 INFO L225 Difference]: With dead ends: 3987 [2022-12-14 14:13:09,667 INFO L226 Difference]: Without dead ends: 3987 [2022-12-14 14:13:09,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:13:09,668 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 55 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:09,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 23 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:13:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3987 states. [2022-12-14 14:13:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3987 to 3987. [2022-12-14 14:13:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3987 states, 3726 states have (on average 3.2466451959205584) internal successors, (12097), 3986 states have internal predecessors, (12097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 12097 transitions. [2022-12-14 14:13:09,755 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 12097 transitions. Word has length 6 [2022-12-14 14:13:09,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:09,755 INFO L495 AbstractCegarLoop]: Abstraction has 3987 states and 12097 transitions. [2022-12-14 14:13:09,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 12097 transitions. [2022-12-14 14:13:09,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 14:13:09,756 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:09,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 14:13:09,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 14:13:09,756 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:09,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:09,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1347629735, now seen corresponding path program 1 times [2022-12-14 14:13:09,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:09,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847107242] [2022-12-14 14:13:09,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:09,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:09,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:09,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847107242] [2022-12-14 14:13:09,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847107242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:09,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:09,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:13:09,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828041655] [2022-12-14 14:13:09,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:09,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:09,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:09,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:09,824 INFO L87 Difference]: Start difference. First operand 3987 states and 12097 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:10,053 INFO L93 Difference]: Finished difference Result 3537 states and 10771 transitions. [2022-12-14 14:13:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:10,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 14:13:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:10,063 INFO L225 Difference]: With dead ends: 3537 [2022-12-14 14:13:10,064 INFO L226 Difference]: Without dead ends: 3537 [2022-12-14 14:13:10,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:10,064 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:10,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 26 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:13:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2022-12-14 14:13:10,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3537. [2022-12-14 14:13:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3537 states, 3330 states have (on average 3.2345345345345344) internal successors, (10771), 3536 states have internal predecessors, (10771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 10771 transitions. [2022-12-14 14:13:10,134 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 10771 transitions. Word has length 6 [2022-12-14 14:13:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:10,134 INFO L495 AbstractCegarLoop]: Abstraction has 3537 states and 10771 transitions. [2022-12-14 14:13:10,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 10771 transitions. [2022-12-14 14:13:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 14:13:10,135 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:10,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 14:13:10,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 14:13:10,135 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:10,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:10,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1347629733, now seen corresponding path program 1 times [2022-12-14 14:13:10,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:10,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452047148] [2022-12-14 14:13:10,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:10,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:10,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:10,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452047148] [2022-12-14 14:13:10,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452047148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:10,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:10,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:13:10,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702510194] [2022-12-14 14:13:10,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:10,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:13:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:10,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:13:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:13:10,212 INFO L87 Difference]: Start difference. First operand 3537 states and 10771 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:10,603 INFO L93 Difference]: Finished difference Result 3791 states and 11012 transitions. [2022-12-14 14:13:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:13:10,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 14:13:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:10,617 INFO L225 Difference]: With dead ends: 3791 [2022-12-14 14:13:10,617 INFO L226 Difference]: Without dead ends: 3791 [2022-12-14 14:13:10,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:13:10,618 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 141 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:10,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 41 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:13:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2022-12-14 14:13:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 3214. [2022-12-14 14:13:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3032 states have (on average 3.2015171503957784) internal successors, (9707), 3213 states have internal predecessors, (9707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 9707 transitions. [2022-12-14 14:13:10,706 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 9707 transitions. Word has length 6 [2022-12-14 14:13:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:10,706 INFO L495 AbstractCegarLoop]: Abstraction has 3214 states and 9707 transitions. [2022-12-14 14:13:10,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 9707 transitions. [2022-12-14 14:13:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 14:13:10,707 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:10,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:10,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 14:13:10,707 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2006178553, now seen corresponding path program 1 times [2022-12-14 14:13:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:10,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367906694] [2022-12-14 14:13:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:10,897 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:10,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367906694] [2022-12-14 14:13:10,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367906694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:10,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:10,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:13:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145875850] [2022-12-14 14:13:10,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:10,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:13:10,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:10,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:13:10,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:13:10,899 INFO L87 Difference]: Start difference. First operand 3214 states and 9707 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:11,059 INFO L93 Difference]: Finished difference Result 2840 states and 8602 transitions. [2022-12-14 14:13:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:11,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 14:13:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:11,067 INFO L225 Difference]: With dead ends: 2840 [2022-12-14 14:13:11,067 INFO L226 Difference]: Without dead ends: 2840 [2022-12-14 14:13:11,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:13:11,068 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:11,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 11 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:13:11,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2022-12-14 14:13:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2840. [2022-12-14 14:13:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2697 states have (on average 3.189469781238413) internal successors, (8602), 2839 states have internal predecessors, (8602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 8602 transitions. [2022-12-14 14:13:11,128 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 8602 transitions. Word has length 8 [2022-12-14 14:13:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:11,128 INFO L495 AbstractCegarLoop]: Abstraction has 2840 states and 8602 transitions. [2022-12-14 14:13:11,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 8602 transitions. [2022-12-14 14:13:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 14:13:11,129 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:11,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:11,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 14:13:11,129 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err18ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2006178556, now seen corresponding path program 1 times [2022-12-14 14:13:11,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:11,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163081151] [2022-12-14 14:13:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:11,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:11,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:11,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163081151] [2022-12-14 14:13:11,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163081151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:11,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:11,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 14:13:11,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044165046] [2022-12-14 14:13:11,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:11,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:13:11,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:11,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:13:11,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 14:13:11,567 INFO L87 Difference]: Start difference. First operand 2840 states and 8602 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:12,367 INFO L93 Difference]: Finished difference Result 4661 states and 14306 transitions. [2022-12-14 14:13:12,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 14:13:12,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 14:13:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:12,376 INFO L225 Difference]: With dead ends: 4661 [2022-12-14 14:13:12,376 INFO L226 Difference]: Without dead ends: 4661 [2022-12-14 14:13:12,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:13:12,377 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 353 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:12,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 104 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 14:13:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states. [2022-12-14 14:13:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 3234. [2022-12-14 14:13:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3091 states have (on average 3.214170171465545) internal successors, (9935), 3233 states have internal predecessors, (9935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 9935 transitions. [2022-12-14 14:13:12,427 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 9935 transitions. Word has length 8 [2022-12-14 14:13:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:12,427 INFO L495 AbstractCegarLoop]: Abstraction has 3234 states and 9935 transitions. [2022-12-14 14:13:12,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 9935 transitions. [2022-12-14 14:13:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 14:13:12,428 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:12,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:12,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 14:13:12,428 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:12,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:12,428 INFO L85 PathProgramCache]: Analyzing trace with hash 500866579, now seen corresponding path program 1 times [2022-12-14 14:13:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:12,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902225336] [2022-12-14 14:13:12,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:12,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:12,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:12,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902225336] [2022-12-14 14:13:12,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902225336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:12,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:12,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:13:12,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257477551] [2022-12-14 14:13:12,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:12,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:13:12,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:12,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:13:12,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:13:12,467 INFO L87 Difference]: Start difference. First operand 3234 states and 9935 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:12,807 INFO L93 Difference]: Finished difference Result 3546 states and 10584 transitions. [2022-12-14 14:13:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:13:12,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 14:13:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:12,815 INFO L225 Difference]: With dead ends: 3546 [2022-12-14 14:13:12,815 INFO L226 Difference]: Without dead ends: 3546 [2022-12-14 14:13:12,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:13:12,816 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 117 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:12,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 23 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:13:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3546 states. [2022-12-14 14:13:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3546 to 3231. [2022-12-14 14:13:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3231 states, 3088 states have (on average 3.2121113989637307) internal successors, (9919), 3230 states have internal predecessors, (9919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 9919 transitions. [2022-12-14 14:13:12,873 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 9919 transitions. Word has length 9 [2022-12-14 14:13:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:12,873 INFO L495 AbstractCegarLoop]: Abstraction has 3231 states and 9919 transitions. [2022-12-14 14:13:12,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 9919 transitions. [2022-12-14 14:13:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 14:13:12,873 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:12,874 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:12,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 14:13:12,874 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:12,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:12,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1695424781, now seen corresponding path program 1 times [2022-12-14 14:13:12,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:12,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454888827] [2022-12-14 14:13:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:12,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:13:12,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:12,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454888827] [2022-12-14 14:13:12,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454888827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:12,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:12,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:13:12,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387469802] [2022-12-14 14:13:12,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:12,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:12,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:12,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:12,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:12,913 INFO L87 Difference]: Start difference. First operand 3231 states and 9919 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:13,106 INFO L93 Difference]: Finished difference Result 3008 states and 9079 transitions. [2022-12-14 14:13:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:13,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10 [2022-12-14 14:13:13,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:13,112 INFO L225 Difference]: With dead ends: 3008 [2022-12-14 14:13:13,112 INFO L226 Difference]: Without dead ends: 3008 [2022-12-14 14:13:13,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:13,113 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:13,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 18 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:13:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2022-12-14 14:13:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2909. [2022-12-14 14:13:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2909 states, 2784 states have (on average 3.2101293103448274) internal successors, (8937), 2908 states have internal predecessors, (8937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 8937 transitions. [2022-12-14 14:13:13,151 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 8937 transitions. Word has length 10 [2022-12-14 14:13:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:13,151 INFO L495 AbstractCegarLoop]: Abstraction has 2909 states and 8937 transitions. [2022-12-14 14:13:13,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 8937 transitions. [2022-12-14 14:13:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 14:13:13,151 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:13,152 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:13,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 14:13:13,152 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:13,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:13,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1695424780, now seen corresponding path program 1 times [2022-12-14 14:13:13,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:13,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846009244] [2022-12-14 14:13:13,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:13,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:13:13,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:13,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846009244] [2022-12-14 14:13:13,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846009244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:13,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:13,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:13:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089360043] [2022-12-14 14:13:13,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:13,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:13,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:13,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:13,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:13,202 INFO L87 Difference]: Start difference. First operand 2909 states and 8937 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:13,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:13,356 INFO L93 Difference]: Finished difference Result 2537 states and 7775 transitions. [2022-12-14 14:13:13,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:13,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10 [2022-12-14 14:13:13,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:13,361 INFO L225 Difference]: With dead ends: 2537 [2022-12-14 14:13:13,361 INFO L226 Difference]: Without dead ends: 2537 [2022-12-14 14:13:13,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:13,361 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:13,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 23 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:13:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2022-12-14 14:13:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2537. [2022-12-14 14:13:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2436 states have (on average 3.1917077175697863) internal successors, (7775), 2536 states have internal predecessors, (7775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 7775 transitions. [2022-12-14 14:13:13,392 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 7775 transitions. Word has length 10 [2022-12-14 14:13:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:13,392 INFO L495 AbstractCegarLoop]: Abstraction has 2537 states and 7775 transitions. [2022-12-14 14:13:13,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 7775 transitions. [2022-12-14 14:13:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 14:13:13,393 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:13,393 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:13,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 14:13:13,393 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:13,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:13,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1695437644, now seen corresponding path program 1 times [2022-12-14 14:13:13,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:13,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545628952] [2022-12-14 14:13:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:13,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:13:13,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:13,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545628952] [2022-12-14 14:13:13,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545628952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:13,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:13,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:13:13,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911001600] [2022-12-14 14:13:13,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:13,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:13,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:13,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:13,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:13,422 INFO L87 Difference]: Start difference. First operand 2537 states and 7775 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:13,606 INFO L93 Difference]: Finished difference Result 2455 states and 7378 transitions. [2022-12-14 14:13:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10 [2022-12-14 14:13:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:13,613 INFO L225 Difference]: With dead ends: 2455 [2022-12-14 14:13:13,613 INFO L226 Difference]: Without dead ends: 2455 [2022-12-14 14:13:13,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:13,614 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:13,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 17 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:13:13,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2022-12-14 14:13:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2371. [2022-12-14 14:13:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2275 states have (on average 3.190769230769231) internal successors, (7259), 2370 states have internal predecessors, (7259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 7259 transitions. [2022-12-14 14:13:13,658 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 7259 transitions. Word has length 10 [2022-12-14 14:13:13,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:13,659 INFO L495 AbstractCegarLoop]: Abstraction has 2371 states and 7259 transitions. [2022-12-14 14:13:13,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:13,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 7259 transitions. [2022-12-14 14:13:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 14:13:13,659 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:13,660 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:13,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 14:13:13,660 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:13,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:13,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1695437643, now seen corresponding path program 1 times [2022-12-14 14:13:13,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:13,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532897682] [2022-12-14 14:13:13,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:13,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:13:13,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:13,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532897682] [2022-12-14 14:13:13,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532897682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:13,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:13,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:13:13,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648866565] [2022-12-14 14:13:13,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:13,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:13,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:13,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:13,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:13,727 INFO L87 Difference]: Start difference. First operand 2371 states and 7259 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:13,865 INFO L93 Difference]: Finished difference Result 2159 states and 6575 transitions. [2022-12-14 14:13:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:13,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10 [2022-12-14 14:13:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:13,869 INFO L225 Difference]: With dead ends: 2159 [2022-12-14 14:13:13,870 INFO L226 Difference]: Without dead ends: 2159 [2022-12-14 14:13:13,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:13,870 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:13,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 22 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:13:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2159 states. [2022-12-14 14:13:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2159 to 2159. [2022-12-14 14:13:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 2074 states have (on average 3.170202507232401) internal successors, (6575), 2158 states have internal predecessors, (6575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 6575 transitions. [2022-12-14 14:13:13,896 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 6575 transitions. Word has length 10 [2022-12-14 14:13:13,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:13,896 INFO L495 AbstractCegarLoop]: Abstraction has 2159 states and 6575 transitions. [2022-12-14 14:13:13,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:13,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 6575 transitions. [2022-12-14 14:13:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 14:13:13,897 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:13,897 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:13,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 14:13:13,897 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err18ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-12-14 14:13:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1950607390, now seen corresponding path program 1 times [2022-12-14 14:13:13,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:13,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605738189] [2022-12-14 14:13:13,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:13,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:14,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:14,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605738189] [2022-12-14 14:13:14,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605738189] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:13:14,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676282690] [2022-12-14 14:13:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:14,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:13:14,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:13:14,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:13:14,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a99b75d4-3ce6-49bf-86ba-3c01056cc725/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 14:13:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:14,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 14:13:14,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:13:14,553 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 14:13:14,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-14 14:13:14,611 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 21 treesize of output 26 [2022-12-14 14:13:14,669 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-14 14:13:14,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 14:13:15,831 INFO L321 Elim1Store]: treesize reduction 1080, result has 11.0 percent of original size [2022-12-14 14:13:15,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 11 new quantified variables, introduced 38 case distinctions, treesize of input 691 treesize of output 1203 [2022-12-14 14:13:15,950 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-14 14:13:15,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 402 treesize of output 392 [2022-12-14 14:13:16,177 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-12-14 14:13:16,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 392 treesize of output 399 [2022-12-14 14:13:16,273 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 25 treesize of output 22 [2022-12-14 14:13:16,343 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 17 treesize of output 15 [2022-12-14 14:13:16,440 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 17 treesize of output 15 [2022-12-14 14:13:16,530 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 17 treesize of output 15 [2022-12-14 14:13:21,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:21,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:21,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:21,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 1256 treesize of output 1287 [2022-12-14 14:13:22,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:22,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:22,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:22,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 1337 treesize of output 1451 [2022-12-14 14:13:23,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:23,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:23,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:23,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 767 treesize of output 1502 [2022-12-14 14:13:23,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:23,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:23,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:23,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:23,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:23,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:23,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 460 treesize of output 478 [2022-12-14 14:13:23,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 290 treesize of output 279 [2022-12-14 14:13:23,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 282 treesize of output 247 [2022-12-14 14:13:23,548 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 5 treesize of output 3 [2022-12-14 14:13:23,612 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 190 treesize of output 186 [2022-12-14 14:13:23,692 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 117 treesize of output 115 [2022-12-14 14:13:23,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:23,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:23,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:23,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:23,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:23,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 689 treesize of output 638 [2022-12-14 14:13:23,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:23,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 45 treesize of output 7 [2022-12-14 14:13:23,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 75 treesize of output 87 [2022-12-14 14:13:24,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:24,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:24,239 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 475 treesize of output 52 [2022-12-14 14:13:24,516 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 5 treesize of output 3 [2022-12-14 14:13:24,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:24,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:24,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:24,736 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 45 treesize of output 51 [2022-12-14 14:13:24,739 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 5 treesize of output 3 [2022-12-14 14:13:24,747 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 5 treesize of output 3 [2022-12-14 14:13:24,750 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 9 treesize of output 7 [2022-12-14 14:13:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:24,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:13:25,124 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-12-14 14:13:25,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 283 treesize of output 290 [2022-12-14 14:13:25,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:13:25,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 273 treesize of output 288 [2022-12-14 14:13:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:28,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676282690] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:13:28,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1458464072] [2022-12-14 14:13:28,845 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:13:28,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:13:28,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2022-12-14 14:13:28,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871672920] [2022-12-14 14:13:28,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:13:28,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 14:13:28,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:28,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 14:13:28,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=370, Unknown=6, NotChecked=0, Total=462 [2022-12-14 14:13:28,847 INFO L87 Difference]: Start difference. First operand 2159 states and 6575 transitions. Second operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:13:54,478 WARN L233 SmtUtils]: Spent 10.54s on a formula simplification that was a NOOP. DAG size: 155 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:14:07,503 WARN L233 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:14:09,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:14:11,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:14:13,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:14:24,524 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 137 DAG size of output: 133 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:14:27,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:14:31,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:14:33,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:14:37,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:14:39,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:14:41,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:14:44,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:15:06,096 WARN L233 SmtUtils]: Spent 13.08s on a formula simplification. DAG size of input: 153 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:15:37,974 WARN L233 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:15:40,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:15:45,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:15:47,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:15:50,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:15:52,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:16:25,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:16:28,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:00,990 WARN L233 SmtUtils]: Spent 13.75s on a formula simplification. DAG size of input: 143 DAG size of output: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:17:03,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:06,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:08,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:11,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:14,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:16,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:18,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:20,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:23,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:25,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:27,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:29,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:31,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:33,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:36,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:40,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:42,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:17:45,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:18:19,443 WARN L233 SmtUtils]: Spent 7.93s on a formula simplification that was a NOOP. DAG size: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:18:22,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:18:25,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:19:03,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:19:05,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:19:07,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:19:09,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:19:11,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:19:17,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:19:34,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:19:36,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:19:59,502 WARN L233 SmtUtils]: Spent 5.16s on a formula simplification. DAG size of input: 120 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:20:01,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:20:03,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:20:37,836 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:20:57,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:21:17,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:21:52,868 WARN L233 SmtUtils]: Spent 10.70s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:21:55,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:21:57,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:00,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:02,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:04,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:05,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:08,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:11,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:13,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:16,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:18,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:21,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:23,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:25,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:27,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:45,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:47,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:50,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:52,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:54,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:56,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:22:58,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:23:00,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:23:04,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:23:06,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:23:42,386 WARN L233 SmtUtils]: Spent 9.35s on a formula simplification. DAG size of input: 135 DAG size of output: 132 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:24:09,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:12,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:14,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:16,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:19,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:21,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:23,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:27,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:30,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:32,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:34,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:36,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:39,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:41,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:43,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:45,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:47,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:50,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:52,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:54,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:56,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:24:59,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:25:31,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:26:17,407 WARN L233 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:27:19,948 WARN L233 SmtUtils]: Spent 9.47s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)