./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 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/04_incdec_cas.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW --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-4e7fbc6 [2022-11-23 14:04:20,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:04:20,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:04:20,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:04:20,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:04:20,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:04:20,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:04:20,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:04:20,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:04:20,145 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:04:20,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:04:20,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:04:20,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:04:20,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:04:20,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:04:20,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:04:20,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:04:20,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:04:20,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:04:20,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:04:20,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:04:20,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:04:20,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:04:20,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:04:20,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:04:20,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:04:20,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:04:20,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:04:20,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:04:20,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:04:20,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:04:20,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:04:20,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:04:20,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:04:20,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:04:20,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:04:20,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:04:20,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:04:20,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:04:20,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:04:20,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:04:20,201 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 14:04:20,224 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:04:20,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:04:20,225 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:04:20,225 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:04:20,226 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:04:20,226 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:04:20,226 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:04:20,227 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:04:20,227 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:04:20,227 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:04:20,227 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:04:20,228 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:04:20,228 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:04:20,228 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:04:20,228 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:04:20,229 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:04:20,229 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:04:20,229 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:04:20,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:04:20,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:04:20,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:04:20,231 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:04:20,231 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:04:20,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:04:20,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:04:20,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:04:20,232 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:04:20,232 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:04:20,232 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:04:20,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:04:20,233 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:04:20,233 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:04:20,233 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:04:20,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:04:20,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:04:20,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:04:20,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:04:20,234 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:04:20,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:04:20,235 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:04:20,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:04:20,235 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:04:20,236 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_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/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_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW 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-11-23 14:04:20,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:04:20,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:04:20,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:04:20,483 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:04:20,484 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:04:20,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-ext/04_incdec_cas.i [2022-11-23 14:04:23,459 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:04:23,773 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:04:23,774 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/sv-benchmarks/c/pthread-ext/04_incdec_cas.i [2022-11-23 14:04:23,786 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/data/aee726bc8/bb43b44810d944f9b75e281cf9e2d6df/FLAGdf93ebb50 [2022-11-23 14:04:23,801 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/data/aee726bc8/bb43b44810d944f9b75e281cf9e2d6df [2022-11-23 14:04:23,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:04:23,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:04:23,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:04:23,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:04:23,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:04:23,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:04:23" (1/1) ... [2022-11-23 14:04:23,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae5d88a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:23, skipping insertion in model container [2022-11-23 14:04:23,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:04:23" (1/1) ... [2022-11-23 14:04:23,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:04:23,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:04:24,247 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_389e1629-928c-4f3f-8c8a-58a6f436cd9e/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30285,30298] [2022-11-23 14:04:24,264 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_389e1629-928c-4f3f-8c8a-58a6f436cd9e/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30729,30742] [2022-11-23 14:04:24,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:04:24,288 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:04:24,344 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_389e1629-928c-4f3f-8c8a-58a6f436cd9e/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30285,30298] [2022-11-23 14:04:24,347 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_389e1629-928c-4f3f-8c8a-58a6f436cd9e/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30729,30742] [2022-11-23 14:04:24,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:04:24,410 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:04:24,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:24 WrapperNode [2022-11-23 14:04:24,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:04:24,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:04:24,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:04:24,413 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:04:24,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:24" (1/1) ... [2022-11-23 14:04:24,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:24" (1/1) ... [2022-11-23 14:04:24,483 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2022-11-23 14:04:24,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:04:24,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:04:24,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:04:24,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:04:24,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:24" (1/1) ... [2022-11-23 14:04:24,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:24" (1/1) ... [2022-11-23 14:04:24,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:24" (1/1) ... [2022-11-23 14:04:24,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:24" (1/1) ... [2022-11-23 14:04:24,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:24" (1/1) ... [2022-11-23 14:04:24,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:24" (1/1) ... [2022-11-23 14:04:24,514 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:24" (1/1) ... [2022-11-23 14:04:24,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:24" (1/1) ... [2022-11-23 14:04:24,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:04:24,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:04:24,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:04:24,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:04:24,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:24" (1/1) ... [2022-11-23 14:04:24,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:04:24,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:04:24,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:04:24,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:04:24,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 14:04:24,614 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-23 14:04:24,614 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-23 14:04:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 14:04:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:04:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:04:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:04:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:04:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:04:24,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:04:24,617 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 14:04:24,757 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:04:24,759 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:04:25,319 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:04:25,792 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:04:25,793 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-23 14:04:25,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:04:25 BoogieIcfgContainer [2022-11-23 14:04:25,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:04:25,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:04:25,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:04:25,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:04:25,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:04:23" (1/3) ... [2022-11-23 14:04:25,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc17236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:04:25, skipping insertion in model container [2022-11-23 14:04:25,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:24" (2/3) ... [2022-11-23 14:04:25,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc17236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:04:25, skipping insertion in model container [2022-11-23 14:04:25,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:04:25" (3/3) ... [2022-11-23 14:04:25,812 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2022-11-23 14:04:25,832 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:04:25,833 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-11-23 14:04:25,834 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 14:04:26,018 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 14:04:26,064 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 14:04:26,096 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 147 transitions, 299 flow [2022-11-23 14:04:26,098 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 147 transitions, 299 flow [2022-11-23 14:04:26,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 147 transitions, 299 flow [2022-11-23 14:04:26,169 INFO L130 PetriNetUnfolder]: 9/163 cut-off events. [2022-11-23 14:04:26,169 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 14:04:26,176 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 566 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-11-23 14:04:26,179 INFO L119 LiptonReduction]: Number of co-enabled transitions 3952 [2022-11-23 14:04:38,607 INFO L134 LiptonReduction]: Checked pairs total: 6690 [2022-11-23 14:04:38,607 INFO L136 LiptonReduction]: Total number of compositions: 138 [2022-11-23 14:04:38,616 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 67 transitions, 139 flow [2022-11-23 14:04:38,658 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-11-23 14:04:38,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:04:38,687 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;@34d6c513, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:04:38,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-11-23 14:04:38,691 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-11-23 14:04:38,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-23 14:04:38,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:04:38,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-23 14:04:38,697 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-23 14:04:38,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:04:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash 26995, now seen corresponding path program 1 times [2022-11-23 14:04:38,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:04:38,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945577614] [2022-11-23 14:04:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:04:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:04:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:04:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:04:38,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:04:38,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945577614] [2022-11-23 14:04:38,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945577614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:04:38,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:04:38,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:04:38,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325133025] [2022-11-23 14:04:38,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:04:38,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:04:38,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:04:39,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:04:39,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:04:39,010 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 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:04:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:04:39,150 INFO L93 Difference]: Finished difference Result 207 states and 386 transitions. [2022-11-23 14:04:39,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:04:39,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-11-23 14:04:39,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:04:39,163 INFO L225 Difference]: With dead ends: 207 [2022-11-23 14:04:39,163 INFO L226 Difference]: Without dead ends: 207 [2022-11-23 14:04:39,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:04:39,167 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-11-23 14:04:39,168 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-11-23 14:04:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-23 14:04:39,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2022-11-23 14:04:39,234 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-11-23 14:04:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 385 transitions. [2022-11-23 14:04:39,245 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 385 transitions. Word has length 2 [2022-11-23 14:04:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:04:39,246 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 385 transitions. [2022-11-23 14:04:39,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:04:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 385 transitions. [2022-11-23 14:04:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-23 14:04:39,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:04:39,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-23 14:04:39,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:04:39,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-23 14:04:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:04:39,252 INFO L85 PathProgramCache]: Analyzing trace with hash 26996, now seen corresponding path program 1 times [2022-11-23 14:04:39,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:04:39,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832168849] [2022-11-23 14:04:39,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:04:39,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:04:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:04:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:04:39,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:04:39,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832168849] [2022-11-23 14:04:39,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832168849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:04:39,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:04:39,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:04:39,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328841178] [2022-11-23 14:04:39,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:04:39,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:04:39,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:04:39,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:04:39,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:04:39,403 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-11-23 14:04:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:04:39,504 INFO L93 Difference]: Finished difference Result 164 states and 300 transitions. [2022-11-23 14:04:39,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:04:39,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-23 14:04:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:04:39,511 INFO L225 Difference]: With dead ends: 164 [2022-11-23 14:04:39,512 INFO L226 Difference]: Without dead ends: 164 [2022-11-23 14:04:39,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:04:39,513 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-11-23 14:04:39,514 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-11-23 14:04:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-23 14:04:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-11-23 14:04:39,521 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-11-23 14:04:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 300 transitions. [2022-11-23 14:04:39,523 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 300 transitions. Word has length 2 [2022-11-23 14:04:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:04:39,523 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 300 transitions. [2022-11-23 14:04:39,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:04:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 300 transitions. [2022-11-23 14:04:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 14:04:39,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:04:39,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 14:04:39,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 14:04:39,525 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-23 14:04:39,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:04:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash 804853559, now seen corresponding path program 1 times [2022-11-23 14:04:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:04:39,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575050721] [2022-11-23 14:04:39,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:04:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:04:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:04:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:04:39,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:04:39,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575050721] [2022-11-23 14:04:39,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575050721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:04:39,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:04:39,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:04:39,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932602598] [2022-11-23 14:04:39,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:04:39,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:04:39,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:04:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:04:39,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:04:39,806 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-11-23 14:04:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:04:39,920 INFO L93 Difference]: Finished difference Result 148 states and 272 transitions. [2022-11-23 14:04:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:04:39,920 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-11-23 14:04:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:04:39,922 INFO L225 Difference]: With dead ends: 148 [2022-11-23 14:04:39,922 INFO L226 Difference]: Without dead ends: 148 [2022-11-23 14:04:39,922 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-11-23 14:04:39,923 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 112 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:04:39,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 2 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:04:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-23 14:04:39,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-23 14:04:39,932 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-11-23 14:04:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 272 transitions. [2022-11-23 14:04:39,933 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 272 transitions. Word has length 5 [2022-11-23 14:04:39,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:04:39,934 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 272 transitions. [2022-11-23 14:04:39,934 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-11-23 14:04:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 272 transitions. [2022-11-23 14:04:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 14:04:39,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:04:39,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 14:04:39,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:04:39,936 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-23 14:04:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:04:39,936 INFO L85 PathProgramCache]: Analyzing trace with hash 804853560, now seen corresponding path program 1 times [2022-11-23 14:04:39,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:04:39,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929207240] [2022-11-23 14:04:39,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:04:39,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:04:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:04:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:04:40,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:04:40,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929207240] [2022-11-23 14:04:40,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929207240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:04:40,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:04:40,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:04:40,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367344089] [2022-11-23 14:04:40,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:04:40,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:04:40,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:04:40,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:04:40,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:04:40,109 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-11-23 14:04:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:04:40,213 INFO L93 Difference]: Finished difference Result 132 states and 244 transitions. [2022-11-23 14:04:40,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:04:40,214 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-11-23 14:04:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:04:40,215 INFO L225 Difference]: With dead ends: 132 [2022-11-23 14:04:40,215 INFO L226 Difference]: Without dead ends: 132 [2022-11-23 14:04:40,215 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-11-23 14:04:40,216 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 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-11-23 14:04:40,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:04:40,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-23 14:04:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-23 14:04:40,222 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-11-23 14:04:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 244 transitions. [2022-11-23 14:04:40,223 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 244 transitions. Word has length 5 [2022-11-23 14:04:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:04:40,223 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 244 transitions. [2022-11-23 14:04:40,223 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-11-23 14:04:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 244 transitions. [2022-11-23 14:04:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:04:40,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:04:40,224 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-11-23 14:04:40,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 14:04:40,224 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-23 14:04:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:04:40,225 INFO L85 PathProgramCache]: Analyzing trace with hash -819435276, now seen corresponding path program 1 times [2022-11-23 14:04:40,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:04:40,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195411412] [2022-11-23 14:04:40,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:04:40,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:04:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:04:40,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 14:04:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:04:40,284 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 14:04:40,285 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 14:04:40,286 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (79 of 80 remaining) [2022-11-23 14:04:40,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2022-11-23 14:04:40,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2022-11-23 14:04:40,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 80 remaining) [2022-11-23 14:04:40,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2022-11-23 14:04:40,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2022-11-23 14:04:40,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2022-11-23 14:04:40,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2022-11-23 14:04:40,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2022-11-23 14:04:40,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONMEMORY_LEAK (70 of 80 remaining) [2022-11-23 14:04:40,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2022-11-23 14:04:40,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2022-11-23 14:04:40,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2022-11-23 14:04:40,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2022-11-23 14:04:40,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37ASSERT_VIOLATIONMEMORY_LEAK (65 of 80 remaining) [2022-11-23 14:04:40,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2022-11-23 14:04:40,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2022-11-23 14:04:40,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2022-11-23 14:04:40,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2022-11-23 14:04:40,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2022-11-23 14:04:40,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 80 remaining) [2022-11-23 14:04:40,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2022-11-23 14:04:40,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2022-11-23 14:04:40,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2022-11-23 14:04:40,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2022-11-23 14:04:40,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2022-11-23 14:04:40,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2022-11-23 14:04:40,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 80 remaining) [2022-11-23 14:04:40,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 80 remaining) [2022-11-23 14:04:40,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2022-11-23 14:04:40,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2022-11-23 14:04:40,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2022-11-23 14:04:40,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2022-11-23 14:04:40,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2022-11-23 14:04:40,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2022-11-23 14:04:40,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2022-11-23 14:04:40,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2022-11-23 14:04:40,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2022-11-23 14:04:40,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2022-11-23 14:04:40,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (40 of 80 remaining) [2022-11-23 14:04:40,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2022-11-23 14:04:40,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 80 remaining) [2022-11-23 14:04:40,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 80 remaining) [2022-11-23 14:04:40,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2022-11-23 14:04:40,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2022-11-23 14:04:40,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 80 remaining) [2022-11-23 14:04:40,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 80 remaining) [2022-11-23 14:04:40,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 80 remaining) [2022-11-23 14:04:40,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 80 remaining) [2022-11-23 14:04:40,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 80 remaining) [2022-11-23 14:04:40,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONMEMORY_LEAK (29 of 80 remaining) [2022-11-23 14:04:40,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2022-11-23 14:04:40,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 80 remaining) [2022-11-23 14:04:40,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2022-11-23 14:04:40,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2022-11-23 14:04:40,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37ASSERT_VIOLATIONMEMORY_LEAK (24 of 80 remaining) [2022-11-23 14:04:40,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2022-11-23 14:04:40,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2022-11-23 14:04:40,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2022-11-23 14:04:40,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 80 remaining) [2022-11-23 14:04:40,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2022-11-23 14:04:40,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2022-11-23 14:04:40,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2022-11-23 14:04:40,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2022-11-23 14:04:40,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 80 remaining) [2022-11-23 14:04:40,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2022-11-23 14:04:40,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2022-11-23 14:04:40,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 80 remaining) [2022-11-23 14:04:40,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2022-11-23 14:04:40,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2022-11-23 14:04:40,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 80 remaining) [2022-11-23 14:04:40,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 80 remaining) [2022-11-23 14:04:40,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 80 remaining) [2022-11-23 14:04:40,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 80 remaining) [2022-11-23 14:04:40,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2022-11-23 14:04:40,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2022-11-23 14:04:40,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 80 remaining) [2022-11-23 14:04:40,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 80 remaining) [2022-11-23 14:04:40,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 80 remaining) [2022-11-23 14:04:40,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 80 remaining) [2022-11-23 14:04:40,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 14:04:40,321 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-23 14:04:40,323 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-23 14:04:40,323 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-23 14:04:40,439 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 14:04:40,443 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 14:04:40,443 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 242 places, 252 transitions, 516 flow [2022-11-23 14:04:40,444 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 242 places, 252 transitions, 516 flow [2022-11-23 14:04:40,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 252 transitions, 516 flow [2022-11-23 14:04:40,551 INFO L130 PetriNetUnfolder]: 17/286 cut-off events. [2022-11-23 14:04:40,551 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 14:04:40,559 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 1340 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-11-23 14:04:40,574 INFO L119 LiptonReduction]: Number of co-enabled transitions 29744 [2022-11-23 14:05:01,288 INFO L134 LiptonReduction]: Checked pairs total: 64727 [2022-11-23 14:05:01,289 INFO L136 LiptonReduction]: Total number of compositions: 206 [2022-11-23 14:05:01,290 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 117 places, 126 transitions, 264 flow [2022-11-23 14:05:01,990 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-11-23 14:05:01,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:05:02,000 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;@34d6c513, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:05:02,001 INFO L358 AbstractCegarLoop]: Starting to check reachability of 118 error locations. [2022-11-23 14:05:02,060 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-11-23 14:05:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-23 14:05:02,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:02,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-23 14:05:02,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:02,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash 44933, now seen corresponding path program 1 times [2022-11-23 14:05:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:02,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555992474] [2022-11-23 14:05:02,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:02,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:02,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555992474] [2022-11-23 14:05:02,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555992474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:02,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:02,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:05:02,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795473576] [2022-11-23 14:05:02,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:02,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:05:02,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:02,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:05:02,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:05:02,323 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-11-23 14:05:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:02,784 INFO L93 Difference]: Finished difference Result 13780 states and 41136 transitions. [2022-11-23 14:05:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:02,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-23 14:05:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:02,903 INFO L225 Difference]: With dead ends: 13780 [2022-11-23 14:05:02,905 INFO L226 Difference]: Without dead ends: 13780 [2022-11-23 14:05:02,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:05:02,906 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:02,907 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.2s Time] [2022-11-23 14:05:02,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13780 states. [2022-11-23 14:05:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13780 to 13780. [2022-11-23 14:05:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13780 states, 11294 states have (on average 3.64228794049938) internal successors, (41136), 13779 states have internal predecessors, (41136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13780 states to 13780 states and 41136 transitions. [2022-11-23 14:05:03,493 INFO L78 Accepts]: Start accepts. Automaton has 13780 states and 41136 transitions. Word has length 2 [2022-11-23 14:05:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:03,494 INFO L495 AbstractCegarLoop]: Abstraction has 13780 states and 41136 transitions. [2022-11-23 14:05:03,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 13780 states and 41136 transitions. [2022-11-23 14:05:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-23 14:05:03,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:03,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-23 14:05:03,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 14:05:03,495 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:03,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash 44934, now seen corresponding path program 1 times [2022-11-23 14:05:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:03,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481703307] [2022-11-23 14:05:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:03,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:03,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:03,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481703307] [2022-11-23 14:05:03,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481703307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:03,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:03,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:05:03,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650284406] [2022-11-23 14:05:03,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:03,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:05:03,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:03,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:05:03,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:05:03,522 INFO L87 Difference]: Start difference. First operand 13780 states and 41136 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:04,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:04,122 INFO L93 Difference]: Finished difference Result 11897 states and 34677 transitions. [2022-11-23 14:05:04,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:04,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-23 14:05:04,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:04,308 INFO L225 Difference]: With dead ends: 11897 [2022-11-23 14:05:04,309 INFO L226 Difference]: Without dead ends: 11897 [2022-11-23 14:05:04,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:05:04,311 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 97 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:04,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 22 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 14:05:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11897 states. [2022-11-23 14:05:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11897 to 11709. [2022-11-23 14:05:04,879 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-11-23 14:05:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11709 states to 11709 states and 34377 transitions. [2022-11-23 14:05:04,969 INFO L78 Accepts]: Start accepts. Automaton has 11709 states and 34377 transitions. Word has length 2 [2022-11-23 14:05:04,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:04,969 INFO L495 AbstractCegarLoop]: Abstraction has 11709 states and 34377 transitions. [2022-11-23 14:05:04,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:04,969 INFO L276 IsEmpty]: Start isEmpty. Operand 11709 states and 34377 transitions. [2022-11-23 14:05:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 14:05:04,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:04,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 14:05:04,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 14:05:04,971 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:04,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:04,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1339737353, now seen corresponding path program 1 times [2022-11-23 14:05:04,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:04,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850577297] [2022-11-23 14:05:04,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:04,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:05,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:05,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850577297] [2022-11-23 14:05:05,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850577297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:05,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:05,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:05:05,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640246752] [2022-11-23 14:05:05,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:05,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:05:05,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:05,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:05:05,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:05:05,168 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-11-23 14:05:06,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:06,086 INFO L93 Difference]: Finished difference Result 9549 states and 27641 transitions. [2022-11-23 14:05:06,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:05:06,086 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-11-23 14:05:06,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:06,133 INFO L225 Difference]: With dead ends: 9549 [2022-11-23 14:05:06,133 INFO L226 Difference]: Without dead ends: 9549 [2022-11-23 14:05:06,134 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-11-23 14:05:06,135 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 139 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:06,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 37 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 14:05:06,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9549 states. [2022-11-23 14:05:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9549 to 9165. [2022-11-23 14:05:06,465 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-11-23 14:05:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9165 states to 9165 states and 27278 transitions. [2022-11-23 14:05:06,501 INFO L78 Accepts]: Start accepts. Automaton has 9165 states and 27278 transitions. Word has length 5 [2022-11-23 14:05:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:06,502 INFO L495 AbstractCegarLoop]: Abstraction has 9165 states and 27278 transitions. [2022-11-23 14:05:06,502 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-11-23 14:05:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 9165 states and 27278 transitions. [2022-11-23 14:05:06,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 14:05:06,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:06,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 14:05:06,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 14:05:06,504 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1339737354, now seen corresponding path program 1 times [2022-11-23 14:05:06,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:06,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090397584] [2022-11-23 14:05:06,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:06,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:06,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:06,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090397584] [2022-11-23 14:05:06,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090397584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:06,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:06,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:05:06,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287126750] [2022-11-23 14:05:06,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:06,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:05:06,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:06,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:05:06,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:05:06,662 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-11-23 14:05:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:06,919 INFO L93 Difference]: Finished difference Result 6801 states and 20384 transitions. [2022-11-23 14:05:06,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:06,920 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-11-23 14:05:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:06,952 INFO L225 Difference]: With dead ends: 6801 [2022-11-23 14:05:06,952 INFO L226 Difference]: Without dead ends: 6801 [2022-11-23 14:05:06,953 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-11-23 14:05:06,954 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:06,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 7 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:05:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6801 states. [2022-11-23 14:05:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6801 to 6801. [2022-11-23 14:05:07,242 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-11-23 14:05:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6801 states to 6801 states and 20384 transitions. [2022-11-23 14:05:07,269 INFO L78 Accepts]: Start accepts. Automaton has 6801 states and 20384 transitions. Word has length 5 [2022-11-23 14:05:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:07,269 INFO L495 AbstractCegarLoop]: Abstraction has 6801 states and 20384 transitions. [2022-11-23 14:05:07,269 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-11-23 14:05:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 6801 states and 20384 transitions. [2022-11-23 14:05:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:05:07,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:07,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:05:07,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 14:05:07,271 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:07,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:07,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1417805616, now seen corresponding path program 1 times [2022-11-23 14:05:07,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:07,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548147907] [2022-11-23 14:05:07,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:07,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:07,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:07,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548147907] [2022-11-23 14:05:07,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548147907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:07,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:07,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:05:07,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43580940] [2022-11-23 14:05:07,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:07,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:05:07,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:07,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:05:07,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:05:07,474 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-11-23 14:05:07,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:07,824 INFO L93 Difference]: Finished difference Result 6123 states and 18392 transitions. [2022-11-23 14:05:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:07,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 14:05:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:07,856 INFO L225 Difference]: With dead ends: 6123 [2022-11-23 14:05:07,856 INFO L226 Difference]: Without dead ends: 6123 [2022-11-23 14:05:07,856 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-11-23 14:05:07,857 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 135 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:07,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 18 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:05:07,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6123 states. [2022-11-23 14:05:08,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6123 to 6123. [2022-11-23 14:05:08,160 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-11-23 14:05:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6123 states to 6123 states and 18392 transitions. [2022-11-23 14:05:08,203 INFO L78 Accepts]: Start accepts. Automaton has 6123 states and 18392 transitions. Word has length 6 [2022-11-23 14:05:08,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:08,204 INFO L495 AbstractCegarLoop]: Abstraction has 6123 states and 18392 transitions. [2022-11-23 14:05:08,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 6123 states and 18392 transitions. [2022-11-23 14:05:08,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:05:08,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:08,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:05:08,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 14:05:08,205 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:08,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1417805615, now seen corresponding path program 1 times [2022-11-23 14:05:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:08,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556449166] [2022-11-23 14:05:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:08,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:08,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:08,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556449166] [2022-11-23 14:05:08,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556449166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:08,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:08,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:05:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453012855] [2022-11-23 14:05:08,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:08,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:05:08,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:08,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:05:08,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:05:08,452 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-11-23 14:05:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:08,675 INFO L93 Difference]: Finished difference Result 5455 states and 16432 transitions. [2022-11-23 14:05:08,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:08,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 14:05:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:08,706 INFO L225 Difference]: With dead ends: 5455 [2022-11-23 14:05:08,706 INFO L226 Difference]: Without dead ends: 5455 [2022-11-23 14:05:08,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:05:08,707 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:08,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 11 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:05:08,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5455 states. [2022-11-23 14:05:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5455 to 5455. [2022-11-23 14:05:08,976 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-11-23 14:05:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5455 states to 5455 states and 16432 transitions. [2022-11-23 14:05:08,995 INFO L78 Accepts]: Start accepts. Automaton has 5455 states and 16432 transitions. Word has length 6 [2022-11-23 14:05:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:08,995 INFO L495 AbstractCegarLoop]: Abstraction has 5455 states and 16432 transitions. [2022-11-23 14:05:08,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 5455 states and 16432 transitions. [2022-11-23 14:05:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:05:08,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:08,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:05:08,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 14:05:08,997 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:08,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1417805612, now seen corresponding path program 1 times [2022-11-23 14:05:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:08,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683063080] [2022-11-23 14:05:08,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:08,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:09,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:09,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683063080] [2022-11-23 14:05:09,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683063080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:09,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:09,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:05:09,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702930871] [2022-11-23 14:05:09,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:09,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:05:09,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:09,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:05:09,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:05:09,058 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-11-23 14:05:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:09,374 INFO L93 Difference]: Finished difference Result 5077 states and 15221 transitions. [2022-11-23 14:05:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:09,375 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-11-23 14:05:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:09,392 INFO L225 Difference]: With dead ends: 5077 [2022-11-23 14:05:09,393 INFO L226 Difference]: Without dead ends: 5077 [2022-11-23 14:05:09,393 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-11-23 14:05:09,394 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 49 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:09,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 25 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:05:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5077 states. [2022-11-23 14:05:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5077 to 5005. [2022-11-23 14:05:09,499 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-11-23 14:05:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5005 states to 5005 states and 15119 transitions. [2022-11-23 14:05:09,516 INFO L78 Accepts]: Start accepts. Automaton has 5005 states and 15119 transitions. Word has length 6 [2022-11-23 14:05:09,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:09,516 INFO L495 AbstractCegarLoop]: Abstraction has 5005 states and 15119 transitions. [2022-11-23 14:05:09,517 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-11-23 14:05:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 5005 states and 15119 transitions. [2022-11-23 14:05:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:05:09,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:09,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:05:09,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 14:05:09,518 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:09,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1417805611, now seen corresponding path program 1 times [2022-11-23 14:05:09,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:09,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333062150] [2022-11-23 14:05:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:09,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:09,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333062150] [2022-11-23 14:05:09,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333062150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:09,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:09,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:05:09,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870602810] [2022-11-23 14:05:09,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:09,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:05:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:09,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:05:09,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:05:09,683 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-11-23 14:05:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:09,969 INFO L93 Difference]: Finished difference Result 4525 states and 13697 transitions. [2022-11-23 14:05:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:09,969 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-11-23 14:05:09,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:09,985 INFO L225 Difference]: With dead ends: 4525 [2022-11-23 14:05:09,985 INFO L226 Difference]: Without dead ends: 4525 [2022-11-23 14:05:09,985 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-11-23 14:05:09,987 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.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:09,987 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.3s Time] [2022-11-23 14:05:09,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states. [2022-11-23 14:05:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 4525. [2022-11-23 14:05:10,093 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-11-23 14:05:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4525 states to 4525 states and 13697 transitions. [2022-11-23 14:05:10,112 INFO L78 Accepts]: Start accepts. Automaton has 4525 states and 13697 transitions. Word has length 6 [2022-11-23 14:05:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:10,112 INFO L495 AbstractCegarLoop]: Abstraction has 4525 states and 13697 transitions. [2022-11-23 14:05:10,113 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-11-23 14:05:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4525 states and 13697 transitions. [2022-11-23 14:05:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:05:10,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:10,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:05:10,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 14:05:10,114 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:10,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1417808622, now seen corresponding path program 1 times [2022-11-23 14:05:10,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:10,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386410319] [2022-11-23 14:05:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:10,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:10,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386410319] [2022-11-23 14:05:10,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386410319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:10,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:10,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:05:10,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559757662] [2022-11-23 14:05:10,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:10,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:05:10,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:10,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:05:10,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:05:10,195 INFO L87 Difference]: Start difference. First operand 4525 states and 13697 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-11-23 14:05:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:10,508 INFO L93 Difference]: Finished difference Result 4147 states and 12486 transitions. [2022-11-23 14:05:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:10,509 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-11-23 14:05:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:10,523 INFO L225 Difference]: With dead ends: 4147 [2022-11-23 14:05:10,524 INFO L226 Difference]: Without dead ends: 4147 [2022-11-23 14:05:10,524 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-11-23 14:05:10,529 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 49 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:10,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 22 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:05:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4147 states. [2022-11-23 14:05:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4147 to 4075. [2022-11-23 14:05:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4075 states, 3812 states have (on average 3.2502623294858344) internal successors, (12390), 4074 states have internal predecessors, (12390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4075 states to 4075 states and 12390 transitions. [2022-11-23 14:05:10,642 INFO L78 Accepts]: Start accepts. Automaton has 4075 states and 12390 transitions. Word has length 6 [2022-11-23 14:05:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:10,643 INFO L495 AbstractCegarLoop]: Abstraction has 4075 states and 12390 transitions. [2022-11-23 14:05:10,643 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-11-23 14:05:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4075 states and 12390 transitions. [2022-11-23 14:05:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:05:10,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:10,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:05:10,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 14:05:10,684 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:10,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:10,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1417808621, now seen corresponding path program 1 times [2022-11-23 14:05:10,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:10,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455225378] [2022-11-23 14:05:10,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:10,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:10,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:10,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455225378] [2022-11-23 14:05:10,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455225378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:10,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:10,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:05:10,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036173720] [2022-11-23 14:05:10,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:10,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:05:10,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:10,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:05:10,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:05:10,777 INFO L87 Difference]: Start difference. First operand 4075 states and 12390 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-11-23 14:05:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:11,045 INFO L93 Difference]: Finished difference Result 3595 states and 10968 transitions. [2022-11-23 14:05:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:11,046 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-11-23 14:05:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:11,058 INFO L225 Difference]: With dead ends: 3595 [2022-11-23 14:05:11,058 INFO L226 Difference]: Without dead ends: 3595 [2022-11-23 14:05:11,058 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-11-23 14:05:11,059 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:11,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 26 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:05:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2022-11-23 14:05:11,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 3595. [2022-11-23 14:05:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3392 states have (on average 3.233490566037736) internal successors, (10968), 3594 states have internal predecessors, (10968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 10968 transitions. [2022-11-23 14:05:11,147 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 10968 transitions. Word has length 6 [2022-11-23 14:05:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:11,148 INFO L495 AbstractCegarLoop]: Abstraction has 3595 states and 10968 transitions. [2022-11-23 14:05:11,148 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-11-23 14:05:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 10968 transitions. [2022-11-23 14:05:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:05:11,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:11,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:05:11,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 14:05:11,149 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1417808626, now seen corresponding path program 1 times [2022-11-23 14:05:11,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:11,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078494554] [2022-11-23 14:05:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:11,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:11,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:11,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078494554] [2022-11-23 14:05:11,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078494554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:11,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:11,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:05:11,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168184825] [2022-11-23 14:05:11,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:11,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:05:11,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:11,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:05:11,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:05:11,259 INFO L87 Difference]: Start difference. First operand 3595 states and 10968 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:11,536 INFO L93 Difference]: Finished difference Result 3117 states and 9536 transitions. [2022-11-23 14:05:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:11,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 14:05:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:11,547 INFO L225 Difference]: With dead ends: 3117 [2022-11-23 14:05:11,547 INFO L226 Difference]: Without dead ends: 3117 [2022-11-23 14:05:11,548 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-11-23 14:05:11,548 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 95 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:11,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 16 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:05:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2022-11-23 14:05:11,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 3117. [2022-11-23 14:05:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3117 states, 2958 states have (on average 3.2237998647734956) internal successors, (9536), 3116 states have internal predecessors, (9536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 9536 transitions. [2022-11-23 14:05:11,621 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 9536 transitions. Word has length 6 [2022-11-23 14:05:11,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:11,621 INFO L495 AbstractCegarLoop]: Abstraction has 3117 states and 9536 transitions. [2022-11-23 14:05:11,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 9536 transitions. [2022-11-23 14:05:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:05:11,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:11,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:05:11,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 14:05:11,622 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:11,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1417808625, now seen corresponding path program 1 times [2022-11-23 14:05:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:11,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765116252] [2022-11-23 14:05:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:11,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:11,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765116252] [2022-11-23 14:05:11,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765116252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:11,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:11,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:05:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325201120] [2022-11-23 14:05:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:11,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:05:11,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:11,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:05:11,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:05:11,726 INFO L87 Difference]: Start difference. First operand 3117 states and 9536 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:12,006 INFO L93 Difference]: Finished difference Result 3164 states and 9390 transitions. [2022-11-23 14:05:12,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:12,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 14:05:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:12,019 INFO L225 Difference]: With dead ends: 3164 [2022-11-23 14:05:12,019 INFO L226 Difference]: Without dead ends: 3164 [2022-11-23 14:05:12,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:05:12,020 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 76 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:12,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 18 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:05:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2022-11-23 14:05:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 2876. [2022-11-23 14:05:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2733 states have (on average 3.2111233077204537) internal successors, (8776), 2875 states have internal predecessors, (8776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 8776 transitions. [2022-11-23 14:05:12,115 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 8776 transitions. Word has length 6 [2022-11-23 14:05:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:12,115 INFO L495 AbstractCegarLoop]: Abstraction has 2876 states and 8776 transitions. [2022-11-23 14:05:12,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 8776 transitions. [2022-11-23 14:05:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 14:05:12,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:12,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:05:12,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 14:05:12,121 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:12,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1006514102, now seen corresponding path program 1 times [2022-11-23 14:05:12,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:12,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955866108] [2022-11-23 14:05:12,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:12,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:12,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:12,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955866108] [2022-11-23 14:05:12,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955866108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:12,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:12,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:05:12,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575747595] [2022-11-23 14:05:12,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:12,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:05:12,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:12,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:05:12,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:05:12,373 INFO L87 Difference]: Start difference. First operand 2876 states and 8776 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-11-23 14:05:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:12,557 INFO L93 Difference]: Finished difference Result 2522 states and 7716 transitions. [2022-11-23 14:05:12,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:12,558 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-11-23 14:05:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:12,568 INFO L225 Difference]: With dead ends: 2522 [2022-11-23 14:05:12,568 INFO L226 Difference]: Without dead ends: 2522 [2022-11-23 14:05:12,569 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-11-23 14:05:12,569 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 158 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:12,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 11 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:05:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2022-11-23 14:05:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2522. [2022-11-23 14:05:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2414 states have (on average 3.196354598177299) internal successors, (7716), 2521 states have internal predecessors, (7716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 7716 transitions. [2022-11-23 14:05:12,648 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 7716 transitions. Word has length 8 [2022-11-23 14:05:12,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:12,649 INFO L495 AbstractCegarLoop]: Abstraction has 2522 states and 7716 transitions. [2022-11-23 14:05:12,649 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-11-23 14:05:12,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 7716 transitions. [2022-11-23 14:05:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 14:05:12,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:12,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:05:12,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 14:05:12,650 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err18ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:12,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:12,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1006514099, now seen corresponding path program 1 times [2022-11-23 14:05:12,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:12,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064623078] [2022-11-23 14:05:12,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:12,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:13,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:13,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064623078] [2022-11-23 14:05:13,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064623078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:13,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:13,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 14:05:13,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740932855] [2022-11-23 14:05:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:13,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 14:05:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:13,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 14:05:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:05:13,917 INFO L87 Difference]: Start difference. First operand 2522 states and 7716 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-11-23 14:05:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:15,143 INFO L93 Difference]: Finished difference Result 3362 states and 10236 transitions. [2022-11-23 14:05:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 14:05:15,143 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-11-23 14:05:15,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:15,155 INFO L225 Difference]: With dead ends: 3362 [2022-11-23 14:05:15,155 INFO L226 Difference]: Without dead ends: 3362 [2022-11-23 14:05:15,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-23 14:05:15,156 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 141 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:15,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 110 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 14:05:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2022-11-23 14:05:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 2808. [2022-11-23 14:05:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2808 states, 2700 states have (on average 3.212962962962963) internal successors, (8675), 2807 states have internal predecessors, (8675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 8675 transitions. [2022-11-23 14:05:15,248 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 8675 transitions. Word has length 8 [2022-11-23 14:05:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:15,249 INFO L495 AbstractCegarLoop]: Abstraction has 2808 states and 8675 transitions. [2022-11-23 14:05:15,249 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-11-23 14:05:15,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 8675 transitions. [2022-11-23 14:05:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 14:05:15,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:15,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:05:15,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-23 14:05:15,251 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:15,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:15,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1192329995, now seen corresponding path program 1 times [2022-11-23 14:05:15,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:15,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821244219] [2022-11-23 14:05:15,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:15,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:05:15,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:15,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821244219] [2022-11-23 14:05:15,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821244219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:15,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:15,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:05:15,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404429821] [2022-11-23 14:05:15,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:15,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:05:15,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:15,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:05:15,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:05:15,334 INFO L87 Difference]: Start difference. First operand 2808 states and 8675 transitions. Second operand has 4 states, 3 states have (on average 3.0) 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-11-23 14:05:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:15,771 INFO L93 Difference]: Finished difference Result 3114 states and 9301 transitions. [2022-11-23 14:05:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:05:15,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) 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 9 [2022-11-23 14:05:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:15,780 INFO L225 Difference]: With dead ends: 3114 [2022-11-23 14:05:15,781 INFO L226 Difference]: Without dead ends: 3114 [2022-11-23 14:05:15,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:05:15,781 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 114 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:15,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 24 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:05:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2022-11-23 14:05:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 2805. [2022-11-23 14:05:15,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 2697 states have (on average 3.210604375231739) internal successors, (8659), 2804 states have internal predecessors, (8659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 8659 transitions. [2022-11-23 14:05:15,872 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 8659 transitions. Word has length 9 [2022-11-23 14:05:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:15,872 INFO L495 AbstractCegarLoop]: Abstraction has 2805 states and 8659 transitions. [2022-11-23 14:05:15,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) 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-11-23 14:05:15,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 8659 transitions. [2022-11-23 14:05:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 14:05:15,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:15,874 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:05:15,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-23 14:05:15,874 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1752154926, now seen corresponding path program 1 times [2022-11-23 14:05:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:15,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754322726] [2022-11-23 14:05:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:05:15,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:15,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754322726] [2022-11-23 14:05:15,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754322726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:15,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:15,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:05:15,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954264631] [2022-11-23 14:05:15,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:15,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:05:15,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:15,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:05:15,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:05:15,930 INFO L87 Difference]: Start difference. First operand 2805 states and 8659 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-11-23 14:05:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:16,180 INFO L93 Difference]: Finished difference Result 2733 states and 8290 transitions. [2022-11-23 14:05:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:16,181 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-11-23 14:05:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:16,190 INFO L225 Difference]: With dead ends: 2733 [2022-11-23 14:05:16,191 INFO L226 Difference]: Without dead ends: 2733 [2022-11-23 14:05:16,191 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-11-23 14:05:16,192 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19 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-11-23 14:05:16,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:05:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2022-11-23 14:05:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2649. [2022-11-23 14:05:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 2544 states have (on average 3.21187106918239) internal successors, (8171), 2648 states have internal predecessors, (8171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 8171 transitions. [2022-11-23 14:05:16,273 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 8171 transitions. Word has length 10 [2022-11-23 14:05:16,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:16,274 INFO L495 AbstractCegarLoop]: Abstraction has 2649 states and 8171 transitions. [2022-11-23 14:05:16,274 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-11-23 14:05:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 8171 transitions. [2022-11-23 14:05:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 14:05:16,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:16,275 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:05:16,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-23 14:05:16,275 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:16,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:16,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1752154925, now seen corresponding path program 1 times [2022-11-23 14:05:16,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:16,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818149157] [2022-11-23 14:05:16,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:05:16,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:16,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818149157] [2022-11-23 14:05:16,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818149157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:16,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:16,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:05:16,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028976768] [2022-11-23 14:05:16,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:16,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:05:16,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:16,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:05:16,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:05:16,380 INFO L87 Difference]: Start difference. First operand 2649 states and 8171 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-11-23 14:05:16,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:16,591 INFO L93 Difference]: Finished difference Result 2447 states and 7515 transitions. [2022-11-23 14:05:16,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:16,592 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-11-23 14:05:16,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:16,601 INFO L225 Difference]: With dead ends: 2447 [2022-11-23 14:05:16,601 INFO L226 Difference]: Without dead ends: 2447 [2022-11-23 14:05:16,602 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-11-23 14:05:16,603 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 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.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:16,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 23 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:05:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2022-11-23 14:05:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2447. [2022-11-23 14:05:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2351 states have (on average 3.1965121225010633) internal successors, (7515), 2446 states have internal predecessors, (7515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 7515 transitions. [2022-11-23 14:05:16,679 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 7515 transitions. Word has length 10 [2022-11-23 14:05:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:16,679 INFO L495 AbstractCegarLoop]: Abstraction has 2447 states and 7515 transitions. [2022-11-23 14:05:16,680 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-11-23 14:05:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 7515 transitions. [2022-11-23 14:05:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 14:05:16,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:16,682 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:05:16,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-23 14:05:16,682 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1752150915, now seen corresponding path program 1 times [2022-11-23 14:05:16,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:16,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642999971] [2022-11-23 14:05:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:16,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:05:16,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:16,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642999971] [2022-11-23 14:05:16,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642999971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:16,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:16,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:05:16,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833275768] [2022-11-23 14:05:16,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:16,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:05:16,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:16,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:05:16,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:05:16,747 INFO L87 Difference]: Start difference. First operand 2447 states and 7515 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-11-23 14:05:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:16,986 INFO L93 Difference]: Finished difference Result 2299 states and 6880 transitions. [2022-11-23 14:05:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:16,987 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-11-23 14:05:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:16,995 INFO L225 Difference]: With dead ends: 2299 [2022-11-23 14:05:16,995 INFO L226 Difference]: Without dead ends: 2299 [2022-11-23 14:05:16,996 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-11-23 14:05:16,996 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:16,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 17 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:05:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2022-11-23 14:05:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2200. [2022-11-23 14:05:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 2110 states have (on average 3.193364928909953) internal successors, (6738), 2199 states have internal predecessors, (6738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 6738 transitions. [2022-11-23 14:05:17,063 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 6738 transitions. Word has length 10 [2022-11-23 14:05:17,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:17,065 INFO L495 AbstractCegarLoop]: Abstraction has 2200 states and 6738 transitions. [2022-11-23 14:05:17,065 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-11-23 14:05:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 6738 transitions. [2022-11-23 14:05:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 14:05:17,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:17,066 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:05:17,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-23 14:05:17,067 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:17,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:17,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1752150910, now seen corresponding path program 1 times [2022-11-23 14:05:17,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:17,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911401230] [2022-11-23 14:05:17,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:17,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:05:17,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:17,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911401230] [2022-11-23 14:05:17,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911401230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:05:17,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:05:17,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:05:17,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105206765] [2022-11-23 14:05:17,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:05:17,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:05:17,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:17,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:05:17,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:05:17,168 INFO L87 Difference]: Start difference. First operand 2200 states and 6738 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-11-23 14:05:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:05:17,376 INFO L93 Difference]: Finished difference Result 1903 states and 5781 transitions. [2022-11-23 14:05:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:05:17,377 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-11-23 14:05:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:05:17,384 INFO L225 Difference]: With dead ends: 1903 [2022-11-23 14:05:17,384 INFO L226 Difference]: Without dead ends: 1903 [2022-11-23 14:05:17,384 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-11-23 14:05:17,385 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:05:17,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 22 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:05:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2022-11-23 14:05:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1903. [2022-11-23 14:05:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1825 states have (on average 3.1676712328767125) internal successors, (5781), 1902 states have internal predecessors, (5781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:05:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 5781 transitions. [2022-11-23 14:05:17,440 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 5781 transitions. Word has length 10 [2022-11-23 14:05:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:05:17,441 INFO L495 AbstractCegarLoop]: Abstraction has 1903 states and 5781 transitions. [2022-11-23 14:05:17,441 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-11-23 14:05:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 5781 transitions. [2022-11-23 14:05:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:05:17,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:05:17,444 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:05:17,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-23 14:05:17,445 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err18ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 115 more)] === [2022-11-23 14:05:17,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:05:17,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1127510226, now seen corresponding path program 1 times [2022-11-23 14:05:17,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:05:17,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951097420] [2022-11-23 14:05:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:05:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:18,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:05:18,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951097420] [2022-11-23 14:05:18,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951097420] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:05:18,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605962591] [2022-11-23 14:05:18,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:05:18,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:05:18,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:05:18,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:05:18,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_389e1629-928c-4f3f-8c8a-58a6f436cd9e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:05:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:05:18,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-23 14:05:18,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:05:18,757 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 14:05:18,758 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-11-23 14:05:18,845 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-11-23 14:05:18,933 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-23 14:05:18,933 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-11-23 14:05:20,773 INFO L321 Elim1Store]: treesize reduction 1080, result has 11.0 percent of original size [2022-11-23 14:05:20,775 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 1218 [2022-11-23 14:05:20,927 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-23 14:05:20,928 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-11-23 14:05:21,253 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-23 14:05:21,253 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-11-23 14:05:21,336 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-11-23 14:05:21,431 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-11-23 14:05:21,519 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-11-23 14:05:21,619 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-11-23 14:05:27,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:27,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:27,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:27,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:27,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:27,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:27,323 INFO L321 Elim1Store]: treesize reduction 127, result has 31.7 percent of original size [2022-11-23 14:05:27,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 1969 treesize of output 1907 [2022-11-23 14:05:27,457 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 129 treesize of output 106 [2022-11-23 14:05:27,663 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 129 treesize of output 106 [2022-11-23 14:05:29,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:29,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:05:29,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:05:29,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:05:29,313 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 166 [2022-11-23 14:05:30,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:30,120 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-23 14:05:30,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 65 [2022-11-23 14:05:31,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:31,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:31,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:05:31,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 647 treesize of output 638 [2022-11-23 14:05:31,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:05:31,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 467 treesize of output 5 [2022-11-23 14:05:31,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:31,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:31,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:31,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:31,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:31,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:31,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:31,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 604 treesize of output 781 [2022-11-23 14:05:32,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:32,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 134 [2022-11-23 14:05:32,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:32,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 11 [2022-11-23 14:05:33,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:33,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:05:33,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 725 treesize of output 746 [2022-11-23 14:05:33,279 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-11-23 14:05:33,447 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-11-23 14:05:33,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:05:33,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 539 treesize of output 5 [2022-11-23 14:05:34,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:05:34,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:34,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 890 treesize of output 833 [2022-11-23 14:05:34,263 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 31 treesize of output 29 [2022-11-23 14:05:34,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:05:34,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 443 treesize of output 23 [2022-11-23 14:05:36,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:36,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:36,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:05:36,554 INFO L321 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2022-11-23 14:05:36,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 125083 treesize of output 125013 [2022-11-23 14:05:38,340 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 125060 treesize of output 109700 [2022-11-23 14:05:38,897 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 109700 treesize of output 109698 [2022-11-23 14:05:39,427 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 109698 treesize of output 109694 [2022-11-23 14:05:39,926 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 109694 treesize of output 109693 [2022-11-23 14:05:40,828 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 109689 treesize of output 109687 [2022-11-23 14:05:41,349 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 109687 treesize of output 109685 [2022-11-23 14:05:41,928 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 109685 treesize of output 109683 [2022-11-23 14:05:43,930 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-11-23 14:05:43,990 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-11-23 14:05:43,995 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 17 treesize of output 13 [2022-11-23 14:05:47,196 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-11-23 14:05:47,202 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 17 treesize of output 13 [2022-11-23 14:05:47,213 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-11-23 14:05:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:47,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:05:47,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:05:47,831 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 298 [2022-11-23 14:05:47,902 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-23 14:05:47,903 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 280 [2022-11-23 14:05:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:05:52,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605962591] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:05:52,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1498255987] [2022-11-23 14:05:52,445 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:336) 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-11-23 14:05:52,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:05:52,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2022-11-23 14:05:52,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745153825] [2022-11-23 14:05:52,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:05:52,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 14:05:52,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:05:52,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 14:05:52,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=369, Unknown=7, NotChecked=0, Total=462 [2022-11-23 14:05:52,455 INFO L87 Difference]: Start difference. First operand 1903 states and 5781 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-11-23 14:06:03,458 WARN L233 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 147 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:06:23,159 WARN L233 SmtUtils]: Spent 6.74s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:06:39,428 WARN L233 SmtUtils]: Spent 14.67s on a formula simplification. DAG size of input: 129 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:07:08,063 WARN L233 SmtUtils]: Spent 24.21s on a formula simplification. DAG size of input: 160 DAG size of output: 159 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:07:10,338 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-11-23 14:07:12,358 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-11-23 14:07:14,442 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-11-23 14:07:41,465 WARN L233 SmtUtils]: Spent 20.98s on a formula simplification. DAG size of input: 140 DAG size of output: 136 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:07:44,787 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-11-23 14:07:58,867 WARN L233 SmtUtils]: Spent 12.52s on a formula simplification that was a NOOP. DAG size: 108 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:08:03,253 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-11-23 14:08:24,712 WARN L233 SmtUtils]: Spent 18.35s on a formula simplification. DAG size of input: 157 DAG size of output: 145 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:08:48,707 WARN L233 SmtUtils]: Spent 19.40s on a formula simplification. DAG size of input: 137 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:09:05,168 WARN L233 SmtUtils]: Spent 15.27s on a formula simplification. DAG size of input: 153 DAG size of output: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:09:28,384 WARN L233 SmtUtils]: Spent 16.58s on a formula simplification. DAG size of input: 136 DAG size of output: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:09:35,289 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-11-23 14:09:37,338 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-11-23 14:09:39,775 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-11-23 14:09:41,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:09:44,023 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-11-23 14:09:47,176 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-11-23 14:09:54,675 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-11-23 14:09:56,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:09:57,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:10:30,395 WARN L233 SmtUtils]: Spent 29.27s on a formula simplification that was a NOOP. DAG size: 187 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:10:32,731 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 [0, 1] [2022-11-23 14:10:35,663 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-11-23 14:10:37,689 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-11-23 14:10:39,699 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-11-23 14:10:45,186 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-11-23 14:10:48,170 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-11-23 14:10:50,212 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-11-23 14:10:52,259 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-11-23 14:10:54,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 [0, 1] [2022-11-23 14:11:04,253 WARN L233 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 116 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:11:07,083 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-11-23 14:11:24,579 WARN L233 SmtUtils]: Spent 16.67s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:11:26,588 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-11-23 14:11:36,072 WARN L233 SmtUtils]: Spent 7.36s on a formula simplification. DAG size of input: 119 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:11:38,202 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-11-23 14:11:43,539 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-11-23 14:11:45,638 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-11-23 14:11:47,716 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-11-23 14:11:50,608 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-11-23 14:11:54,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:11:56,125 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-11-23 14:11:57,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:12:00,155 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-11-23 14:12:02,468 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-11-23 14:12:04,832 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-11-23 14:12:07,213 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 [0, 1] [2022-11-23 14:12:09,345 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 [0, 1] [2022-11-23 14:12:13,166 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-11-23 14:12:15,184 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-11-23 14:12:17,996 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-11-23 14:12:21,392 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-11-23 14:12:24,195 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 [0, 1] [2022-11-23 14:12:26,235 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 [0, 1] [2022-11-23 14:12:28,932 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 [0, 1] [2022-11-23 14:12:31,061 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 [0, 1] [2022-11-23 14:12:33,349 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-11-23 14:12:35,398 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-11-23 14:12:38,173 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 [0, 1] [2022-11-23 14:12:40,337 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 [0, 1] [2022-11-23 14:12:42,344 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 [0, 1] [2022-11-23 14:13:01,237 WARN L233 SmtUtils]: Spent 16.72s on a formula simplification. DAG size of input: 183 DAG size of output: 182 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:13:03,289 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-11-23 14:13:05,355 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-11-23 14:13:07,365 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-11-23 14:13:16,542 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-11-23 14:13:17,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:13:21,080 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-11-23 14:13:30,294 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-11-23 14:13:32,373 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-11-23 14:13:34,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:13:38,602 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-11-23 14:13:40,646 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-11-23 14:13:43,010 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-11-23 14:13:53,881 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-11-23 14:14:05,525 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-11-23 14:15:07,914 WARN L233 SmtUtils]: Spent 57.24s on a formula simplification. DAG size of input: 183 DAG size of output: 181 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:15:16,167 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-11-23 14:15:18,205 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-11-23 14:15:21,813 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-11-23 14:15:24,169 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-11-23 14:15:26,182 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-11-23 14:15:28,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:15:30,647 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-11-23 14:15:32,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:15:34,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:16:02,347 WARN L233 SmtUtils]: Spent 24.98s on a formula simplification. DAG size of input: 176 DAG size of output: 174 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:16:05,491 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-11-23 14:16:11,197 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-11-23 14:16:13,221 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-11-23 14:16:34,292 WARN L233 SmtUtils]: Spent 12.28s on a formula simplification. DAG size of input: 127 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:16:36,742 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-11-23 14:16:38,757 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-11-23 14:16:40,799 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-11-23 14:16:44,133 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-11-23 14:16:55,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:16:58,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:17:00,294 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-11-23 14:17:02,020 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-11-23 14:17:05,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:17:08,796 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-11-23 14:17:11,127 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-11-23 14:17:21,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:17:23,990 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-11-23 14:17:27,128 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-11-23 14:17:29,148 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-11-23 14:17:31,545 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-11-23 14:17:33,552 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-11-23 14:17:35,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:17:45,786 WARN L233 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 123 DAG size of output: 120 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:17:48,000 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-11-23 14:17:49,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:17:52,325 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-11-23 14:17:55,383 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-11-23 14:18:05,836 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-11-23 14:18:44,533 WARN L233 SmtUtils]: Spent 24.52s on a formula simplification. DAG size of input: 141 DAG size of output: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:18:47,618 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-11-23 14:18:50,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:19:12,125 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]